Abstract
This paper presents a language, CHA, and semantics for studying Statechartslike drawings. CHA is a process algebra. CHA terms are interpreted as programs that extend Mealy- style finite automata with concurrent execution and hierarchical structure. Transitions in CHA can cross hierarchy boundaries, and it is this fact that makes giving a semantics to CHA (and to Statecharts) an interesting problem. In the terminology of [Mil89] all of the function symbols in CHA except the constants are static combinators.
CHA is given an operational semantics in the Structural Operational Semantics (SOS) style of Plotkin [Plo81]. The Transition System Specification (TSS) methodology of [GV88] is employed, and the TSS presented is in the tyft/tyxt format from that paper. Conformance to the tyft/tyxt format has several benefits for analyzing CHA, the most important of which is that bisimulation is a congruence in the Labeled Transition System (LTS) C of the language.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
R. Bol and J. F. Groote. The Meaning of Negative Premises in Transition System Specifications. Technical Report CS-R8950, Centre for Mathematics and Computer Science, Amsterdam, The Netherlands, 1990.
J. F. Groote. Transition System Specifications with Negative Premises. Technical Report CS-R8950, Centre for Mathematics and Computer Science, Amsterdam, The Netherlands, 1989. An extended abstract appeared in J.C.M. Baeten and J. W. Klop, editors, Proceedings of Concur90, LNCS 458, Amsterdam, 1990, Springer-Verlag.
J. F. Groote and F. W. Vaandrager. Structured Operational Semantics and Bisimulation as a Congruence. Technical Report CS-R8845, Centre for Mathematics and Computer Science, Amsterdam, The Netherlands, 1988. An extended abstract appeared in G. Ausiello, M. Dezani-Ciancaglini and S. Ronchi Del, editors, Proceedings of ICALP 89, LNCS 372, Stresa, 1990, Springer-Verlag.
D. Harel. Statecharts: a visual formalism for complex systems. In Science of Computer Programing, 1987.
C. Huzing, R. Gerth, and W. P. de Roever. Modeling statecharts behavior in a fully abstract way. In 13th CAAP, Lecture notes in Computer Science 299, Springer, Berlin, 1988.
D. Harel, A. Pnueli, J. P. Schmidt, and R. Sherman. On the formal semantics of statecharts. In Proc. 2nd IEEE Symposium on Logic in Computer Science, 1987.
R. Milner. Communication and Concurrency. Series in Computer Science, Prentice-Hall, 1989.
G. D. Plotkin. A Structural Approach To Operational Semantics. Technical Report DAIMI FN-19, Computer Science Department, Aarhus University, 1981.
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Uselton, A.C. (1993). Structured operational semantics for concurrency and hierarchy. In: Enjalbert, P., Finkel, A., Wagner, K.W. (eds) STACS 93. STACS 1993. Lecture Notes in Computer Science, vol 665. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56503-5_42
Download citation
DOI: https://doi.org/10.1007/3-540-56503-5_42
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56503-1
Online ISBN: 978-3-540-47574-3
eBook Packages: Springer Book Archive