Graph transformation systems (GTS) have been successfully proposed as a general, theoretically sound model for concurrency. Petri nets (PN), on the other side, are a central and intuitive formalism for concurrent or distributed systems, well supported by a number of analysis techniques/tools. Some PN classes have been shown to be instances of GTS. In this paper, we change perspective presenting an operational semantics of GTS in terms of Symmetric Nets, a well-known class of Coloured Petri nets featuring a structured syntax that outlines model symmetries. Some practical exploitations of the proposed operational semantics are discussed. In particular, a recently developed structural calculus for SN is used to validate graph rewriting rules in a symbolic way.
An Operational Semantics of Graph Transformation Systems Using Symmetric Nets / L. Capra. - (2019). ((Intervento presentato al 3. convegno Working Formal Methods Symposium tenutosi a Timisoara nel 2019.
Titolo: | An Operational Semantics of Graph Transformation Systems Using Symmetric Nets |
Autori: | |
Parole Chiave: | Symmetric Nets; Graph Rewriting; Structural Analysis |
Settore Scientifico Disciplinare: | Settore INF/01 - Informatica |
Data di pubblicazione: | 2019 |
URL: | https://arxiv.org/abs/1909.01750v1 |
Digital Object Identifier (DOI): | 10.4204/EPTCS.303.8 |
Appare nelle tipologie: | 24 - Pre-print |
File in questo prodotto:
File | Descrizione | Tipologia | Licenza | |
---|---|---|---|---|
1909.01750.pdf | Pre-print (manoscritto inviato all'editore) | Open Access Visualizza/Apri |