Petri nets: an introduction
Advances in Petri nets 1986, part II on Petri nets: applications and relationships to other models of concurrency
Process versus unfolding semantics for place/transition Petri nets
Theoretical Computer Science - Special volume on Petri nets
Information and Computation
Fundamenta Informaticae - Special issue on graph transformations
Algebraic approaches to graph transformation. Part I: basic concepts and double pushout approach
Handbook of graph grammars and computing by graph transformation
Concurrent Graph and Term Graph Rewriting
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
An Event Structure Semantics for P/T Contextual Nets: Asymmetric Event Structures
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
On Relating Rewriting Systems and Graph Grammars to Event Structures
Proceedings of the International Workshop on Graph Transformations in Computer Science
Tutorial introduction to the algebraic approach of graph grammars
Proceedings of the 3rd International Workshop on Graph-Grammars and Their Application to Computer Science
A Comparison Between Petri-Nets and Graph Grammars
WG '80 Proceedings of the International Workshop on Graphtheoretic Concepts in Computer Science
An Event Structure Semantics for Graph Grammars with Parallel Productions
Selected papers from the 5th International Workshop on Graph Gramars and Their Application to Computer Science
Bisimulation Equivalences for Graph Grammars
Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002]
Approximating the Behaviour of Graph Transformation Systems
ICGT '02 Proceedings of the First International Conference on Graph Transformation
Ugo Montanari and Graph Transformation
Concurrency, Graphs and Models
Unfolding Graph Transformation Systems: Theory and Applications to Verification
Concurrency, Graphs and Models
Models of Computation: A Tribute to Ugo Montanari's Vision
Concurrency, Graphs and Models
Analysing refactoring dependencies using unfolding of graph transformation systems
Proceedings of the 7th International Conference on Frontiers of Information Technology
Automated assistance for search-based refactoring using unfolding of graph transformation systems
ICGT'10 Proceedings of the 5th international conference on Graph transformations
Processes for adhesive rewriting systems
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
On the concurrent semantics of algebraic graph grammars
Formal Methods in Software and Systems Modeling
Concurrent rewriting for graphs with equivalences
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Static analysis of dynamic communication systems by partner abstraction
SAS'07 Proceedings of the 14th international conference on Static Analysis
Rule-based modelling of cellular signalling
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
| Hi-index | 0.00 |
We propose an unfolding semantics for graph transformation systems in the double-pushout (DPO) approach. Mimicking Winskel's construction for Petri nets, a graph grammar is unfolded into an acyclic branching structure, that is itself a (nondeterministic occurrence) graph grammar describing all the possible computations of the original grammar. The unfolding can be abstracted naturally to a prime algebraic domain and then to an event structure semantics. We show that such event structure coincides both with the one defined by Corradini et al. [3] via a comma category construction on the category of concatenable derivation traces, and with the one proposed by Schied [13], based on a deterministic variant of the DPO approach. This results, besides confirming the appropriateness of our unfolding construction, unify the various event structure semantics for the DPO approach to graph transformation.