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.
Towards a Petri net Model for Graph Transformation Systems / L. Capra. - In: IAENG INTERNATIONAL JOURNAL OF APPLIED MATHEMATICS. - ISSN 1992-9978. - 49:4(2019 Nov 20), pp. 415-420.
Titolo: | Towards a Petri net Model for Graph Transformation Systems |
Autori: | |
Parole Chiave: | Formal models; Graph Transformation Systems; Symmetric Nets |
Settore Scientifico Disciplinare: | Settore INF/01 - Informatica |
Data di pubblicazione: | 20-nov-2019 |
Rivista: | |
URL: | http://www.iaeng.org/IJAM/issues_v49/issue_4/IJAM_49_4_04.pdf |
Tipologia: | Article (author) |
Appare nelle tipologie: | 01 - Articolo su periodico |
File in questo prodotto:
File | Descrizione | Tipologia | Licenza | |
---|---|---|---|---|
IJAM_49_4_04.pdf | Publisher's version/PDF | Open Access Visualizza/Apri |