A categorical linear framework for Petri nets

This research brings together, in a methodical way, several approaches to giving a compositional theory of Petri nets using category theory and to the use of linear logic in specifying and reasoning about Petri nets. The authors construct categories of nets based on V.C.V. de Paiva's dialectica category models (1989) of linear logic in which they are able to exploit the structure of de Paiva's models to give constructions on categories of nets. Using a category of safe nets as an example, it is shown how this approach yields both existing and novel constructions on nets and their computational interpretation is discussed. The authors also indicate how more general categories of nets can be expressed in this framework.<<ETX>>

[1]  Glynn Winskel,et al.  Petri Nets, Algebras, Morphisms, and Compositionality , 1987, Inf. Comput..

[2]  Hans-Dieter Ehrich,et al.  On Realization and Implementation , 1981, MFCS.

[3]  Hartmut Ehrig,et al.  Algebraic Implementation of Abstract Data Types , 1982, Theor. Comput. Sci..

[4]  José Meseguer,et al.  Petri nets are monoids: a new algebraic foundation for net theory , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[5]  Valeria de Paiva,et al.  A Dialectica-like Model of Linear Logic , 1989, Category Theory and Computer Science.

[6]  Wolfgang Reisig Petri Nets: An Introduction , 1985, EATCS Monographs on Theoretical Computer Science.

[7]  Glynn Winskel,et al.  A category of labelled Petri nets and compositional proof system , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[8]  Krzysztof R. Apt,et al.  Ten Years of Hoare's Logic: A Survey—Part I , 1981, TOPL.