Abstract
Graph transformation systems are widely recognized as a powerful formalism for the specification of concurrent and distributed systems. Therefore, the need emerges naturally of developing formal concurrent semantics for graph transformation systems allowing for a suitable description and analysis of their computational properties. The aim of this chapter is to review and compare various concurrent semantics for the double pushout (DPO) algebraic approach to graph transformation, using different mathematical structures and describing computations at different levels of abstraction. We first present a trace semantics, based on the classical shift equivalence on graph derivations. Next we introduce graph processes, which lift to the graph transformation framework the notion of non-sequential process for Petri nets. Trace and process semantics are shown to be equivalent, in the sense that given a graph transformation system, the corresponding category of derivation traces and that of (concatenable) processes turns out to be isomorphic. Finally, a more abstract description of graph transformation systems computations is given by defining a semantics based on Winskel’s event structures.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
