Advertisement

A graph rewriting framework for Statecharts semantics

  • Andrea Maggiolo-Schettini
  • Adriano Peron
Specification and Semantics
Part of the Lecture Notes in Computer Science book series (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.

Keywords

External World Transition Production Maximal Step Dynamic Semantic Standard Step 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    von der Beek, M.: A Comparison of Statecharts Variants, LNCS 863, Springer, Berlin, 1994, pp. 128–148.Google Scholar
  2. 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. 3.
    Harel, D.: Statecharts: A Visual Formalism for Complex Systems, Science of Computer Programming 8 (1987), pp. 231–274.Google Scholar
  4. 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. 5.
    Janssens, D., Rozenberg, G.: Actor Grammars, Mathematical Systems Theory 22 (1989), pp. 75–107.Google Scholar
  6. 6.
    Maggiolo-Schettini, A., Peron, A.: Semantics of Full Statecharts Based on Graph Rewriting, Springer LNCS 776, 1994, pp. 265–279.Google Scholar
  7. 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. 8.
    Schied, G.: On Relating Rewriting Systems and Graph Grammars to Event Structures, Springer LNCS 776, 1994, pp. 326–340.Google Scholar
  9. 9.
    Winskel, G.: An Introduction to Event Structures, Springer LNCS 354, 1989, pp. 364–397.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Andrea Maggiolo-Schettini
    • 1
  • Adriano Peron
    • 2
  1. 1.Dipartimento di InformaticaUniversità di PisaPisaItaly
  2. 2.Dipartimento di Matematica e InformaticaUniversità di UdineUdineItaly

Personalised recommendations