Abstract
We characterize the statecharts step semantics of Pnueli and Shalev as a mapping Ψ from an inductively defined algebra of statecharts terms to a domain of labeled transition systems (LTSs). Statecharts equivalence =sc, i.e. LTS isomorphism, is shown not to be a congruence and hence the step semantics is not compositional. We define a new semantic mapping Ψ > to a domain of LTSs with a richer label structure, and show that LTS isomorphism in this domain is the largest congruence contained in =sc.
Research supported in part by NSF Grants CCR-9120995 and CCR-9208585, and AFOSR Grant F49620-93-1-0250.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
D. Hard. Statecharts: A visual formalism for complex systems. Science of Computer Programming, 8: 231–274, 1987.
C. Huising, R. Gerth, and W. P. de Roever. Modeling statecharts behavior in a fully abstract way. In Proc. 13th CAAP, number 299 in Lecture Notes in Computer Science, pages 271–294. Springer Verlag, 1989.
D. Hanel and A. Pnueli. On the development of reactive systems. In Logic and Models of Concurrent Sytems, number 133 in NATO ASI series, pages 477–498, Berlin, 1985. Springer-Verlag.
D. Hanel, A. Pnueli, J. P. Schmidt, and R. Sherman. On the formal semantics of statecharts. Proc. 2nd IEEE Symposium on Logic in Computer Science, pages 54–64, 1987.
J. J. M. Hooman, S. Ramesh, and W. P. de Roever. A compositional axiomatisation of statecharts. Theoretical Computer Science, 101: 289–335, July 1992.
F. Maraninchi. The Argos language: graphical representation of automata and description of reactive systems. In IEEE Workshop on Visual Languages, 1991.
F. Maraninchi. Operational and compositional semantics of synchronous automaton composition. In Proceedings of CONCUR ‘82 — Third International Conference on Concurrency Theory, 1992.
A. Peron. Synchronous and Asynchronous Models for Statecharts. PhD thesis, Universita di Pisa-Genova-Udine, 1993.
A. Pnueli. Applications of temporal logic to the specification and verification of reactive systems: A survey of current trends. In et. al. de Baker, editor, Current Trends in Concurrency, number 224 in Lecture Notes inComputer Science, pages 510–584, 1986.
A. Pnueli and M. Shalev. What is in a step: On the semantics of statecharts. In Theoretical Aspects of Computer Software, number 526 in Lecture Notes inComputer Science, pages 244–264, 1991.
A. C. Uselton and S. A. Smolka. State refinement in process algebra. In Proceedings of the North American Process Algebra Workshop, Ithaca, New York, August 1993. Available as TR 93–1369, Department of Computer Science, Cornell University.
A. C. Uselton and S. A. Smolka. A process algebraic semantics for state-charts via state refinement. In Proceedings of IFIP Working Conference on Programming Concepts, Methods and Calculi (PROCOMET), June 1994. To appear.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Uselton, A.C., Smolka, S.A. (1994). A Compositional Semantics for Statecharts using Labeled Transition Systems. In: Jonsson, B., Parrow, J. (eds) CONCUR ’94: Concurrency Theory. CONCUR 1994. Lecture Notes in Computer Science, vol 836. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-48654-1_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-48654-1_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58329-5
Online ISBN: 978-3-540-48654-1
eBook Packages: Springer Book Archive