Advances in Petri nets 1986, part II on Petri nets: applications and relationships to other models of concurrency
Information and Computation
Algebraic approach to single-pushout graph transformation
Theoretical Computer Science - Special issue on selected papers of the International Workshop on Computing by Graph Transformation, Bordeaux, France, March 21–23, 1991
Symbolic Model Checking
On the semantics of place/transition Petri nets
Mathematical Structures in Computer Science
Unfolding semantics of graph transformation
Information and Computation
A framework for the verification of infinite-state graph transformation systems
Information and Computation
Graph-grammars: An algebraic approach
SWAT '73 Proceedings of the 14th Annual Symposium on Switching and Automata Theory (swat 1973)
Van Kampen colimits as bicolimits in span
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Processes for adhesive rewriting systems
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
ICGT'06 Proceedings of the Third international conference on Graph Transformations
Van Kampen colimits as bicolimits in span
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Unfolding-based diagnosis of systems with an evolving topology
Information and Computation
On the computation of McMillan's prefix for contextual nets and graph grammars
ICGT'10 Proceedings of the 5th international conference on Graph transformations
Static type checking of model transformation programs
ICGT'10 Proceedings of the 5th international conference on Graph transformations
A lattice-theoretical perspective on adhesive categories
Journal of Symbolic Computation
| Hi-index | 0.00 |
We generalize the unfolding semantics, previously developed for concrete formalisms such as Petri nets and graph grammars, to the abstract setting of (single pushout) rewriting over adhesive categories. The unfolding construction is characterized as a coreflection, i.e. the unfolding functor arises as the right adjoint to the embedding of the category of occurrence grammars into the category of grammars. As the unfolding represents potentially infinite computations, we need to work in adhesive categories with "well-behaved" colimits of ω-chains of monomorphisms. Compared to previous work on the unfolding of Petri nets and graph grammars, our results apply to a wider class of systems, which is due to the use of a refined notion of grammar morphism.