Skip to main content

Semantics of full statecharts based on graph rewriting

  • Conference paper
  • First Online:
Book cover Graph Transformations in Computer Science

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 776))

Abstract

A semantics of Statecharts based on graph rewriting is presented. State-charts are formalized as graph replacement rules. The graph of derivations gives a sequential semantics which agrees with Statechart step semantics.

Research partially supported by the COMPUGRAPH Base Research Exprit Working Group n. 7183.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Berry G., Boudol L., The Chemical Abstract Machine, Proceedings 17th Annual Symposium on Principles of Programming Languages, 1990, pp. 81–94.

    Google Scholar 

  2. Ehrig, H., Introduction to the Algebraic Theory of Graph Grammars, LNCS 73, Springer, Berlin, 1979, pp. 1–69.

    Google Scholar 

  3. Ehrig, H., Habel, A., Kreowski, H.-J., Parisi-Presicce, F., Parallelism and Concurrency in Hight Level Replacement Systems, Mathematical Structures in Computer Science 1 (1991), pp. 361–404.

    Google Scholar 

  4. Harel, D., Statecharts: A Visual Formalism for Complex Systems, Science of Computer Programming 8 (1987), pp. 231–274.

    Google Scholar 

  5. Harel, D., Pnueli, A., Schmidt, J., P., Sherman, R., On the Formal Semantics of Statecharts, Proceedings of 2nd IEEE Symposium on Logic in Computer Science, IEEE CS Press, 1987, pp. 54–64.

    Google Scholar 

  6. Hess, L., Mayoh, B., Graphics and their Grammars, LNCS 291, Springer, Berlin, 1991, pp. 232–249.

    Google Scholar 

  7. Janssens, D., Rozenberg, G., Actor Grammars, Mathematical Systems Theory 22 (1989), pp. 75–107.

    Google Scholar 

  8. Lodaya, K., Ramanujam, R., Thiagarajan, P.S., A Logic for Distributed Transition Systems, LNCS 354, Springer, Berlin, 1989, pp. 508–522.

    Google Scholar 

  9. Maggiolo-Schettini, A., Peron, A., Semantics for Statecharts Based on Graph Rewriting, in: Prinetto, P. and Camurati, P. (Eds.), Correct Hardware Design Methodologies, North-Holland, Amsterdam, pp. 91–114, 1992.

    Google Scholar 

  10. Maggiolo-Schettini, A., Peron, A., Semantics for Full Statecharts Based on Graph Rewriting, Dipartimento di Matematica ed Informatica Università di Udine, Research Report UDMI/11/93/RR, 1993.

    Google Scholar 

  11. Peron, A., Synchronous and Asynchronous Models for Statecharts, Dipartimento di Informatica Università di Pisa, Ph.D. Thesis, TD 21/93, 1993.

    Google Scholar 

  12. Wirsing, M., Algebraic Specification, in Handbook of Theoretical Computer Science, Formal Methods and Semantics, Elsevier-MIT Press, 1990, pp. 675–788.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Hans Jürgen Schneider Hartmut Ehrig

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Maggiolo-Schettini, A., Peron, A. (1994). Semantics of full statecharts based on graph rewriting. In: Schneider, H.J., Ehrig, H. (eds) Graph Transformations in Computer Science. Lecture Notes in Computer Science, vol 776. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57787-4_17

Download citation

  • DOI: https://doi.org/10.1007/3-540-57787-4_17

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57787-4

  • Online ISBN: 978-3-540-48333-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics