Abstract
The firing rule of Petri nets relies on a residuation operation for the commutative monoid of natural numbers. We identify a class of residuated commutative monoids, called Petri algebras, for which one can mimic the token game of Petri nets to define the behaviour of generalized Petri net whose flow relation and place contents are valued in such algebraic structures. We show that Petri algebras coincide with the positive cones of lattice-ordered commutative groups and constitute the subvariety of the (duals of) residuated lattices generated by the commutative monoid of natural numbers. We introduce a class of nets, termed lexicographic Petri nets, that are associated with the positive cones of the lexicographic powers of the additive group of real numbers. This class of nets is universal in the sense that any net associated with some Petri algebras can be simulated by a lexicographic Petri net. All the classical decidable properties of Petri nets however are undecidable on the class of lexicographic Petri nets. Finally we turn our attention to bounded nets associated with Petri algebras and show that their dynamics can be reformulated in term of MV-algebras.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Badouel, E., Chenou, J.: Nets Enriched over Closed Monoidal Structures. In: van der Aalst, W.M.P., Best, E. (eds.) ICATPN 2003. LNCS, vol. 2679, pp. 64–81. Springer, Heidelberg (2003)
Badouel, E., Chenou, J., Guillou, G.: Petri Algebras. Inria Research Report 5355 (November 2004), http://www.inria.fr/rrrt/rr-5355.html
Bahls, P., Cole, J., Galatos, N., Jipsen, P., Tsinakis, C.: Cancellative residuated lattices. Algebra Universalis 12(42), 1–24 (2003)
Birkhoff, G.: Lattice Theory, 3rd edn., vol. XXV. AMS Colloquium Publications, American Mathematical Society, Providence, (1967)
Blount, K.: On the structure of residuated lattices. Ph. D. Thesis, Dept. of Mathematics, Vanderbilt University, Nashville, Tennessee (1999)
Blount, K., Tsinakis, C.: The structure of Residuated Lattices, International Journal of Algebra and Computation (to appear)
Cignoli, R., D’Ottaviano, I., Mundici, D.: Algebraic foundations of many-valued reasoning. In: Trends in Logic-studia Logica Library 7. Kluwer Academic Publishers, Dordrecht (2000)
Unifying Petri Nets. In: Ehrig, H., Juhas, G., Padberg, J., Rozenberg, G. (eds.) APN 2001. LNCS, vol. 2128, Springer, Heidelberg (2001)
Galatos, N.: Varieties of Residuated Lattices. Ph. D. Thesis, Dept. of Mathematics (Vanderbilt University, Nashville, Tennessee) (2003)
Jipsen, P., Tsinakis, C.: A survey of Residuated Lattices. In: Martinez, J. (ed.) Ordered Algebraic Structures, pp. 19–56. Kluwer Academic Publishers, Dordrecht (2002)
Memmi, G., Finkel, A.: An introduction to fifo nets - monogeneous nets: a subclass of fifo nets. Theoretical Computer Science 35, 191–214 (1985)
Mundici, D.: Interpretation of AF C*-algebras in Lukasiewicz sentential calculus. Journal of Functional Analysis 65(1), 15–63 (1986)
Murata, T.: Petri Nets: Properties, Analysis and Applications. Proceedings of the IEEE 77(4), 541–580 (1989)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Badouel, E., Chenou, J., Guillou, G. (2005). Petri Algebras. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds) Automata, Languages and Programming. ICALP 2005. Lecture Notes in Computer Science, vol 3580. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11523468_60
Download citation
DOI: https://doi.org/10.1007/11523468_60
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-27580-0
Online ISBN: 978-3-540-31691-6
eBook Packages: Computer ScienceComputer Science (R0)