Sequential and concurrent behaviour in Petri net theory
Theoretical Computer Science
Nonsequential processes
Category theory for computing science
Category theory for computing science
Information and Computation
Petri nets and algebraic specifications
Theoretical Computer Science
Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
Theoretical Computer Science - Special volume on Petri nets
Specification and proof in membership equational logic
Theoretical Computer Science - Trees in algebra and programming
Functorial models for petri nets
Information and Computation
Maude: specification and programming in rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
Membership algebra as a logical framework for equational specification
WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
A Comparison of Petri Net Semantics under the Collective Token Philosophy
ASIAN '98 Proceedings of the 4th Asian Computing Science Conference on Advances in Computing Science
Representation Theorems for Petri Nets
Foundations of Computer Science: Potential - Theory - Cognition, to Wilfried Brauer on the occasion of his sixtieth birthday
Algebraic Models for Contextual Nets
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
On the Semantics of Petri Nets
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Elements of General Net Theory
Proceedings of the Advanced Course on General Net Theory of Processes and Systems: Net Theory and Applications
Petri's Axioms of Concurrency- A Selection of Recent Results
ICATPN '97 Proceedings of the 18th International Conference on Application and Theory of Petri Nets
Rewriting Logic as a Unifying Framework for Petri Nets
Unifying Petri Nets, Advances in Petri Nets
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Hi-index | 0.00 |
Revisiting the view of "Petri nets as monoids" suggested by Meseguer and Montanari, we give a direct proof of the well-known result that the class of Best/Devillers processes, which represents the behavior of Petri nets under the collective token semantics, has a sound and complete axiomatization in terms of symmetric monoidal categories. Using membership equational logic for the axiomatization, we prove the result by an explicit construction of a natural isomorphism between suitable functors. Our interest in the collective token semantics is motivated by earlier work on the use of rewriting logic as a uniform framework for different Petri net classes, especially including high-level Petri nets, where individuality of tokens can be already expressed at the system level.