Information and Computation
Petri nets for modeling of dynamic systems—a survey
Automatica (Journal of IFAC)
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Generalized Automata and Their Net Representations
Unifying Petri Nets, Advances in Petri Nets
Continuous Petri Nets and Transition Systems
Unifying Petri Nets, Advances in Petri Nets
Dualities Between Nets and Automata Induced by Schizophrenic Objects
CTCS '95 Proceedings of the 6th International Conference on Category Theory and Computer Science
An Axiomatization of the Token Game Based on Petri Algebras
Fundamenta Informaticae
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
An Axiomatization of the Token Game Based on Petri Algebras
Fundamenta Informaticae
Hi-index | 0.00 |
We show how the firing rule of Petri nets relies on a residuation operation for the commutative monoid of natural numbers. On that basis we introduce closed monoidal structures which are residuated monoids. We identify a class of closed monoidal structures (associated with a family of idempotent group dioids) for which one can mimic the token game of Petri nets to define the behaviour of these generalized Petri nets whose flow relations and place contents are valued in the closed monoidal structure.