Advances in Petri nets 1986, part II on Petri nets: applications and relationships to other models of concurrency
Handbook of graph grammars and computing by graph transformation: vol. 3: concurrency, parallelism, and distribution
A Static Analysis Technique for Graph Transformation Systems
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
ESM Systems and the Composition of Their Computations
Proceedings of the International Workshop on Graph Transformations in Computer Science
Rule Invariants in Graph Transformation Systems for Analyzing Safety-Critical Systems
ICGT '02 Proceedings of the First International Conference on Graph Transformation
On the semantics of place/transition Petri nets
Mathematical Structures in Computer Science
| Hi-index | 0.00 |
The Workshop on Petri Nets and Graph Transformations, which is currently at its second edition, is focussed on the mutual relationship between two prominent specification formalisms for concurrency and distribution, namely Petri nets and graph transformation systems. It belongs to the folklore that Petri nets can be seen as rewriting systems over (multi)sets, the rewriting rules being the transitions, and, as such, they can be seen as special graph transformation systems, acting over labelled discrete graphs. The basic notions of Petri nets like marking, enabling, firing, steps and step sequences can be naturally “translated” to corresponding notions of graph transformation systems. Due to this close correspondence there has been a mutual influence between the two fields, which has lead to a fruitful cross-fertilisation.