Abstract
We introduce the notion of strongly concatenable process as a refinement of concatenable processes [3] which can be expressed axiomatically via a functor \({\cal Q}\)[_] from the category of Petri nets to an appropriate category of symmetric strict monoidal categories, in the precise sense that, for each net N, the strongly concatenable processes of N are isomorphic to the arrows of \({\cal Q}\)[N]. In addition, we identify a coreflection right adjoint to \({\cal Q}\)[_] and characterize its replete image, thus yielding an axiomatization of the category of net computations.
Supported by EU Human Capital and Mobility grant ERBCHBGCT920005.
Chapter PDF
Similar content being viewed by others
Keywords
- Natural Transformation
- Monoidal Category
- Concatenable Process
- Monoidal Functor
- Symmetric Monoidal Category
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
E. Best and R. Devillers. Sequential and Concurrent Behaviour in Petri Net Theory. Theoretical Computer Science, n. 55, pp. 87–136, Elsevier, 1987.
C. Brown, D. Gurr, and V. de Paiva. A Linear Specification Language for Petri Nets. Technical Report DAIMI PB-363, Computer Science Dept., Aarhus University, 1991.
P. Degano, J. Meseguer, and U. Montanari. Axiomatizing Net Computations and Processes. In Proceedings of the 4th LICS Symposium, pp. 175–185, IEEE, 1989.
U. Goltz and W. Reisig. The Non-Sequential Behaviour of Petri Nets. Information and Computation, n. 57, pp. 125–147, Academic Press, 1983.
S. MacLane. Categories for the Working Mathematician. Springer-Verlag, 1971.
J. Meseguer and U. Montanari. Petri Nets are Monoids. Information and Computation, n. 88, pp. 105–154, Academic Press, 1990.
M. Nielsen, G. Plotkin, and G. Winskel. Petri Nets, Event Structures and Domains, Part 1. Theoretical Computer Science, n. 13, pp. 85–108, Elsevier, 1981.
C.A. Petri. Kommunikation mit Automaten. PhD thesis, Institut für Instrumentelle Mathematik, Bonn, Germany, 1962.
C.A. Petri. Non-Sequential Processes. Interner Bericht ISF-77-5, Gesellschaft für Mathematik und Datenverarbeitung, Bonn, Germany, 1977.
W. Reisig. Petri Nets. Springer-Verlag, 1985.
V. Sassone. On the Semantics of Petri Nets: Processes, Unfoldings, and Infinite Computations. PhD Thesis TD 6/94, Dipartimento di Informatica, Università di Pisa, 1994.
V. Sassone. Some Remarks on Concatenable Processes. Technical Report TR 6/94, Dipartimento di Informatica, Università di Pisa, 1994.
G. Winskel. A New Definition of Morphism on Petri Nets. In Proceedings of STACS '84, LNCS, n. 166, pp. 140–150, Springer-Verlag, 1984.
G. Winskel. Petri Nets, Algebras, Morphisms and Compositionality. Information and Computation, n. 72, pp. 197–238, Academic Press, 1987.
Author information
Authors and Affiliations
Editor information
Additional information
In Memory and Dedication to my Beloved mother Liana
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sassone, V. (1995). On the category of Petri net computations. In: Mosses, P.D., Nielsen, M., Schwartzbach, M.I. (eds) TAPSOFT '95: Theory and Practice of Software Development. CAAP 1995. Lecture Notes in Computer Science, vol 915. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59293-8_205
Download citation
DOI: https://doi.org/10.1007/3-540-59293-8_205
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59293-8
Online ISBN: 978-3-540-49233-7
eBook Packages: Springer Book Archive