Skip to main content

A graph rewriting framework for Statecharts semantics

  • Specification and Semantics
  • Conference paper
  • First Online:
Graph Grammars and Their Application to Computer Science (Graph Grammars 1994)

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

Abstract

The purpose of the paper is to show that graph rewriting is a suitable environment to formalize semantics of specification languages with dynamic features. This is exemplified considering Statecharts in a variant allowing dynamic creation of processes. Graph rewriting rules give the semantics of Statecharts in such interpretation. Standard Statecharts semantics can be recovered by suitably restricting derivation sequences that describe behaviours in the dynamic semantics. More abstract semantics, better suited to study equivalences and general properties, can be obtained from graph rewriting semantics.

Research partially supported by the COMPUGRAPH Base Research Esprit Working Group n. 7183 and by Esprit BRA 8130 LOMAPS.

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. von der Beek, M.: A Comparison of Statecharts Variants, LNCS 863, Springer, Berlin, 1994, pp. 128–148.

    Google Scholar 

  2. Corradini, A., Ehrig, H., Löewe, M., Montanari, U., Rossi, F.: Note on Standard Representation of Graphs and Graph Derivations, Springer LNCS 776, 1994, pp. 104–118.

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  6. Maggiolo-Schettini, A., Peron, A.: Semantics of Full Statecharts Based on Graph Rewriting, Springer LNCS 776, 1994, pp. 265–279.

    Google Scholar 

  7. Peron, A., Maggiolo-Schettini, A.: Transitions as Interrupts: A New Semantics for Timed Statecharts, Springer LNCS 789, 1994, pp. 806–821.

    Google Scholar 

  8. Schied, G.: On Relating Rewriting Systems and Graph Grammars to Event Structures, Springer LNCS 776, 1994, pp. 326–340.

    Google Scholar 

  9. Winskel, G.: An Introduction to Event Structures, Springer LNCS 354, 1989, pp. 364–397.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Janice Cuny Hartmut Ehrig Gregor Engels Grzegorz Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Maggiolo-Schettini, A., Peron, A. (1996). A graph rewriting framework for Statecharts semantics. In: Cuny, J., Ehrig, H., Engels, G., Rozenberg, G. (eds) Graph Grammars and Their Application to Computer Science. Graph Grammars 1994. Lecture Notes in Computer Science, vol 1073. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61228-9_82

Download citation

  • DOI: https://doi.org/10.1007/3-540-61228-9_82

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61228-5

  • Online ISBN: 978-3-540-68388-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics