Petr nets, algebras, morphisms, and compositionality
Information and Computation
Advances in Petri nets 1986, part II on Petri nets: applications and relationships to other models of concurrency
Information and Computation
The Category of Typed Graph Grammars and its Adjunctions with Categories
Selected papers from the 5th International Workshop on Graph Gramars and Their Application to Computer Science
Unfolding of Double-Pushout Graph Grammars is a Coreflection
TAGT'98 Selected papers from the 6th International Workshop on Theory and Application of Graph Transformations
General Morphisms of Petri Nets (Extended Abstract)
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Graph Rewriting in Some Categories of Partial Morphisms
Proceedings of the 4th International Workshop on Graph-Grammars and Their Application to Computer Science
| Hi-index | 0.00 |
In the area of specification and modelling of concurrent systems, Petri nets have become a standard tool, and they still work behind the scenes in tools for graph transformation systems (cf. [1]). Moreover there is still potential for crossfertilization between the graph transformation and Petri net community. Even a better understanding of adhesive categories [2] and the related concepts of [3] seems possible in light of the proposed notion of weakly adhesive categories[4], which has emerged during work on the generalization of the co-reflective semantics of Petri nets to the realm of graph transformation and adhesive rewriting systems.