Abstract
Statecharts is a visual language for specifying the behavior of reactive systems. The language extends finite-state machines with concepts of hierarchy, concurrency, and priority. Despite its popularity as a design notation for embedded systems, precisely defining its semantics has proved extremely challenging. In this paper, we present a simple process algebra, called Statecharts Process Language (SPL), which is expressive enough for encoding Statecharts in a structure-preserving and semanticspreserving manner. We also establish that the behavioral equivalence bisimulation, when applied to SPL, preserves Statecharts semantics.
This work was supported by the National Aeronautics and Space Administration under NASA Contract No. NAS1-97046 while the first author was in residence at the Institute for Computer Applications in Science and Engineering (ICASE), NASA Langley Research Center, Hampton, VA 23681-2199, USA. The third author was supported by NSF grants CCR-9257963, CCR-9505662, CCR-9804091, and INT- 9603441, AFOSR grant F49620-95-1-0508, and ARO grant P-38682-MA.
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
J. C. M. Baeten and W. P. Weijland. Process Algebra, vol. 18 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1990.
G. Berry and G. Gonthier. The ESTEREL synchronous programming language: Design, semantics, implementation. Science of Computer Programming, 19:87–152, 1992.
T. Bolognesi and E. Brinksma. Introduction to the ISO specification language LOTOS. Computer Networks and ISDN Systems, 14:25–59, 1987.
R. Cleaveland, G. Lüttgen, and V. Natarajan. Priority in process algebra. In Handbook of Process Algebra. Elsevier, 1999.
R. Cleaveland and S. Sims. The NCSU Concurrency Workbench. In CAV’ 96, vol. 1102 of LNCS, pages 394–397, 1996. Springer Verlag.
W. Damm, B. Josko, H. Hungar, and A. Pnueli. A compositional real-time semantics of STATEMATE designs. In Compositionality: The SignificantDifference, vol. 1536 of LNCS, pages 186–238, 1997. Springer Verlag.
D. Harel. Statecharts: A visual formalism for complex systems. Science of Computer Programming, 8:231–274, 1987.
D. Harel and A. Naamad. The STATEMATE semantics of Statecharts. ACM Transactions on Software Engineering, 5(4):293–333, 1996.
D. Harel, A. Pnueli, J. P. Schmidt, and R. Sherman. On the formal semantics of Statecharts. In LICS’ 87, pages 56–64, 1987. IEEE Computer Society Press.
D. Harel and M. Politi. Modeling Reactive Systems with Statecharts: The STATEMATE Approach. McGraw Hill, 1998.
M. Hennessy and T. Regan. A process algebra for timed systems. Information and Computation, 117:221–239, 1995.
C. A. R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985.
G. J. Holzmann. The model checker Spin. IEEE Transactions on Software Engineering, 23(5):279–295, 1997.
J. J. M. Hooman, S. Ramesh, and W.-P. de Roever. A compositional axiomatization of Statecharts. Theoretical Computer Science, 101:289–335, 1992.
C. Huizing. Semantics of Reactive Systems: Comparison and Full Abstraction. PhD thesis, Eindhoven University of Technology, 1991.
F. Levi. Verification of Temporal and Real-Time Properties of Statecharts. PhD thesis, University of Pisa-Genova-Udine, 1997.
A. Maggiolo-Schettini, A. Peron, and S. Tini. Equivalences of Statecharts. In CONCUR’ 96, vol. 1119 of LNCS, pages 687–702, 1996. Springer Verlag.
F. Maraninchi. Operational and compositional semantics of synchronous automaton compositions. In CONCUR’ 92, vol. 630 of LNCS, pages 550–564, 1992. Springer Verlag.
E. Mikk, Y. Lakhnech, C. Petersohn, and M. Siegel. On formal semantics of Statecharts as supported by STATEMATE. In Second BCS-FACS Northern Formal Methods Workshop, 1997. Springer Verlag.
E. Mikk, Y. Lakhnech, M. Siegel, and G. J. Holzmann. Verifying Statecharts with Spin. In WIFT’ 98, 1998. IEEE Computer Society Press.
R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
A. Pnueli and M. Shalev. What is in a step: On the semantics of Statecharts. In TACS’ 91, vol. 526 of LNCS, pages 244–264, 1991. Springer Verlag.
P. Scholz. Design of Reactive Systems and their Distributed Implementation with Statecharts. PhD thesis, Munich University of Technology, 1998.
A. C. Uselton and S. A. Smolka. A compositional semantics for Statecharts using labeled transition systems. In CONCUR’ 94, vol. 836 of LNCS, pages 2–17, 1994. Springer Verlag.
A. C. Uselton and S. A. Smolka. A process-algebraic semantics for Statecharts via state refinement. In ProcOMET’ 94. North Holland/Elsevier, 1994.
M. v.d. Beeck. A comparison of Statecharts variants. In FTRTFT’ 94, vol. 863 of LNCS, pages 128–148, 1994. Springer Verlag.
C. Verhoef. A congruence theorem for structured operational semantics with predicates and negative premises. Nordic Journal of Computing, 2:274–302, 1995.
W. Yi. CCS + time = an interleaving model for real time systems. In ICALP’ 91, vol. 510 of LNCS, pages 217–228, 1991. Springer Verlag.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lüttgen, G., von der Beeck, M., Cleaveland, R. (1999). Statecharts via Process Algebra. In: Baeten, J.C.M., Mauw, S. (eds) CONCUR’99 Concurrency Theory. CONCUR 1999. Lecture Notes in Computer Science, vol 1664. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48320-9_28
Download citation
DOI: https://doi.org/10.1007/3-540-48320-9_28
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66425-3
Online ISBN: 978-3-540-48320-5
eBook Packages: Springer Book Archive