Graph transformation systems: a semantics based on (stochastic) symmetric nets

Graph transformation systems (GTS) and Petri nets (PN) are central formal models for concurrent/distributed systemsPN are usually considered as instances of GTS, due to the lack of ability to dynamically adapt their structureReversing this perspective, a formal encoding of GTS was recently defined using Symmetric Nets (SN), a High-Level PN formalism which syntactically highlights system behavioural symmetriesThis makes it possible reusing the efficient analysis techniques and tools available for SN, e.g., new achievements in SN structural analysis, which are exploited to characterize valid transformation rulesThis paper is on the same line, but follows a very different approachInstead of directly formalizing GTS in terms of SN, a SN semantics is provided for the classical double-pushout approach, by constructively translating DPO rules to equivalent SN subnetsUsing the native stochastic extension of SN (SSN) permits a for free encoding of stochastic GTS.