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.
Cite
CITATION STYLE
Maggiolo-Schettini, A., & Peron, A. (1996). A graph rewriting framework for Statecharts semantics. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1073, pp. 107–121). Springer Verlag. https://doi.org/10.1007/3-540-61228-9_82
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
