An axiomatization of the category of Petri net computations

Mathematical Structures in Computer Science

Volumn 8, Issue 2, 1998, Pages 117-151

  Sassone, Vladimiro ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84974615662     PISSN: 09601295     EISSN: None     Source Type: Journal    
DOI: 10.1017/S096012959700248X     Document Type: Article

References (23)

1. Benabou, J. (1963) Categories with Multiplication. Comptes Rendue Academie Science Paris 256 1887–1890.
2. Best, E. and Devillers, R. (1987) Sequential and Concurrent Behaviour in Petri Net Theory. Theoretical Computer Science 55 87–136.
3. Brown, C. and Gurr, D. (1990) A Categorical Linear Framework for Petri Nets. In: Proceedings of the 5th LICS Symposium, IEEE Press 208–218.
4. Brown, C., Gurr, D. and de Paiva, V. (1991) A Linear Specification Language for Petri Nets, Technical Report DAIMI PB-363, Computer Science Department, University of Aarhus.
5. Burnside, W. (1911) Theory of Groups of Finite Order, Cambridge University Press.
6. Degano, P. Meseguer, J. and Montanari, U. (1996) Axiomatizing the Algebra of Net Computations and Processes. Acta Informatica 33 641–667.
7. Eilenberg, S. and Kelly, G.M. (1966) Closed Categories. In: Eilenberg, S. et al. (eds.) Proceedings of the Conference on Categorical Algebra, La Jolla 1965, Springer-Verlag 421–562.
8. Goltz, U. and Reisig, W. (1983) The Non-Sequential Behaviour of Petri Nets. Information and Computation 57 125–147.
9. Kelly, G. M. (1964) On Mac Lane's Conditions for Coherence of Natural Associativities, Commutativities, etc. Journal of Algebra 1 397–402.
10. Mac Lane, S. (1963) Natural Associativity and Commutativity. Rice University Studies 49 28–46.
11. Mac Lane, S. (1971) Categories for the Working Mathematician, Springer-Verlag.
12. Meseguer, J. and Montanari, U. (1990) Petri Nets are Monoids. Information and Computation 88 105–154.
13. Moore, E. H. (1897) Concerning the abstract group of order k! isomorphic with the symmetric substitution group on k letters. Proceedings of the London Mathematical Society 28 357–366.
14. Nielsen, M., Plotkin, G. and Winskel, G. (1981) Petri Nets, Event Structures and Domains, Part 1. Theoretical Computer Science 13 85–108.
15. Petri, C. A. (1962) Kommunikation mit Automaten. Ph. D. thesis, Institut fur Instrumentelle Mathe-matik Germany.
16. Petri, C. A. (1973) Concepts of Net Theory. In: Proceedings of MFCS'73 Mathematics Institute of the Slovak. Academy of Science 137–146.
17. Petri, C. A. (1977) Non-Sequential Processes, Interner Bericht ISF-77-5, Gesellschaft fiir Mathematik und Datenverarbeitung, Germany.
18. Reisig, W. (1985) Petri Nets, Springer-Verlag.
19. Sassone. V. (1994) On the Semantics of Petri Nets: Processes, Unfoldings, and Infinite Computations, Ph. D. thesis TD 6/94, Dipartimento di Informatica, Universita di Pisa.
20. Sassone. V. (1995) On the Category of Petri Net Computations. In: Mosses, P. et al. (eds.) Proceedings of TAPSOFT '95. Springer-Verlag Lecture Notes in Computer Science 915 334–348.
21. Sassone. V. (1996) An Axiomatization of the Algebra of Petri Net Concatenable Processes. Theo-retical Computer Science 170 277–296.
22. Winskel, G. (1984) A New Definition of Morphism on Petri Nets. In: Fontet, M. and Mehlhorn, K. (eds.) Proceedings of STACS '84. Springer-Verlag Lecture Notes in Computer Science 166 140–150.
23. Winskel, G. (1987) Petri Nets, Algebras, Morphisms and Compositionality. Information and Com-putation 72 197–238.