Functorial models for Petri nets

Information and Computation

Volumn 170, Issue 2, 2001, Pages 207-236

  Bruni, Roberto ^a   Meseguer, José ^b   Montanari, Ugo ^a   Sassone, Vladimiro ^c  

^a UNIVERSITY OF PISA   (Italy)

^b SRI INTERNATIONAL   (United States)

^c UNIVERSITY OF CATANIA   (Italy)

Author keywords

Collective individual token philosophy; Concurrent transition systems; Configuration structures; Monoidal categories; Partial membership equational logic; Pre nets; PT Petri nets

Indexed keywords

ALGEBRA; CONCURRENT ENGINEERING; PETRI NETS; SEMANTICS;

FUNCTORIAL MODELS;

COMPUTER SCIENCE;

EID: 0035526654     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.2001.3050     Document Type: Article

References (36)

1. Bednarczyk, M. A., and Borzyszkowski, A. M. (1999), General morphisms of Petri nets, in "Proceedings of ICALP'99, 26th International Colloquim on Automata. Languages and Programming" (J. Wiedermann, P. van Erode Boas, and M. Nielsen. Eds.), Lecture Notes in Computer Science. Vol. 1644, pp. 190-199, Springer-Verlag, Berlin.
2. Benson, D. B. ( 1975 ). The basic algebraic structures in categories of derivations, Inform. and Control 28, 1-29.
3. Best, E., and Devillers, R. (1987), Sequential and concurrent behaviour in Petri net theory, Theoret. Comput. Sci. 55, 87-136.
4. Bouhoula, A., Jouannaud, J.-P., and Meseguer, J. (2000), Specification and proof in membership equational logic, Theoret. Comput. Sci. 236, 35-132.
5. Brown, C., and Gurr, D. (1990), A categorical linear framework for Petri nets, in "Proceedings of LICS'90, 5th Symposium on Logics in Computer Science," pp. 208-218, IEEE Computer Society, Los Alamitos, CA.
6. Brown, C., Gurr, D., and de Paiva, V (1991), A Linear Specification Language for Petri Nets," Technical Report PB-363, DAIMI.
7. Brunt, R., Meseguer. J., Montanari, U., and Sassone, V. (1998), A comparison of Petri net semantics under the collective token philosophy, in "Proceedings of ASIAN'98, 4th Asian Computing Science Conference" (J. Hsiang and A. Ohori, Eds.), Lecture Notes in Computer Science, Vol. 1358, pp. 225-244, Springer Verlag, Berlin.
8. Bruni, R., Meseguer, J., Montanari, U., and Sassone, V. (1999), Functorial semantics for Petri nets under the individual token philosophy, in "Proceedings of CTCS'99, 8th Conference on Category Theory and Computer Science" (M. Hofmann, G. Rosolini, and D. Pavlovic, Eds.), Electronic Notes in Theoretic Computer Science, Vol. 29, Elsevier, Amsterdam/New York.
9. Cattani, G. L., and Sassone, V. (1996), Higher dimensional transition systems, in "Proceedings of LICS'96, 11th Symposium on Logics in Computer Science," pp. 55-62, IEEE Computer Society, Los Alamitos, CA.
10. Clavel, M., Durán, F., Eker, S., Martí-Oliet, N., Meseguer. J., and Quesada, J. (1999), "Maude: Specification and Programming in Rewriting Logic," SRI International, available at http://maude.csl.sri.com/manual.
11. Degano, P., Meseguer, J., and Montanari, U. (1996), Axiomatizing the algebra of net computations and processes, Acta Inform. 33, 641-667.
12. Gabriel, P., and Ulmer, F. (1971), "Lokal präsentierbare Kategorien," Lecture Notes in Mathematics, Vol. 221, Springer-Verlag, Berlin.
13. van Glabbeek, R. J., and Plotkin, G. D. (1995), Configuration structures, in "Proceedings of LICS'95, 10th Symposium on Logics in Computer Science" (D. Kozen, Ed.), pp. 199-209, IEEE Computer Society, Los Alamitos, CA.
14. Goltz, U., and Reisig, W. (1983), The non-sequential behaviour of Petri nets, Inform. and Comput. 57, 125-147.
15. Hoogers, P. W., Kleijn, H. C. M., and Thiagarajan, P. S. (1996), An event structure semantics for general Petri nets, Theoret. Comput. Sci. 153, 129-170.
16. Hotz, G. (1965), Eine algebraisierung des syntheseproblemen von schaltkreisen. I and II, Elektronische Informationverar-beitung und Kybernetik 1, 185-205: 209-231.
17. Lawvere, F. W. (1968), Some algebraic problems in the context of functorial semanties of algebraic theories, in "Proceedings of the Midwest Category Seminar 11," Lecture Notes in Mathematics, Vol. 61, pp. 41-61, Springer-Verlag, Berlin.
18. Lodaya, K., Ramanujam, R., and Thiagarajan, P. S. (1989), A logic for distributed transition systems, in "Linear Time, Branching Time, and Partial Order in Logics and Models for Concurrency" (J. W. de Bakker, W. P. de Roever, and G. Rozenberg, Eds.), Lecture Notes in Computer Science, Vol. 354, pp. 508-522, Springer-Verlag, Berlin.
19. MacLane, S. (1971), "Categories for the Working Mathematician," Springer-Verlag, Berlin.
20. Meseguer, J. (1998), Membership algebra as a logical framework for equational specification, in "Proceedings of WADT'97, 12th Workshop on Recent Trends in Algebraic Development Techniques" (F. Parisi-Presicce, Ed.), Lecture Notes in Computer Science, Vol. 1376, pp. 18-61, Springer-Verlag, Berlin.
21. Meseguer, J., and Montanari, U. (1990), Petri nets are monoids, Inform. and Comput. 88, 105-155.
22. Meseguer, J., and Montanari, U. (1998), Mapping tile logic into rewriting logic, in "Proceedings of WADT'97, 12th Workshop on Recent Trends in Algebraic Development Techniques" (F. Parisi-Presicce, Ed.), Lecture Notes in Computer Science, Vol. 1376, pp. 62-91, Springer-Verlag, Berlin.
23. Meseguer, J., Montanari, U., and Sassone, V. (1996), Process versus unfolding semantics for place/transition Petri nets, Theoret. Computer Science 153, 171-210.
24. Meseguer, J., Montanari, U., and Sassone, V. (1997), Representation theorems for Petri nets, in "Foundations of Computer Science: Potential Theory-Cognition, to Wilfried Brauer on the Occasion of His Sixtieth Birthday" (Ch. Freksa, M. Jantzen, and R. Valk, Eds.), Lecture Notes in Computer Science, Vol. 1337, pp. 239-249, Springer-Verlag, Berlin.
25. Mossakowski, T. (1996), Equivalences among various logical frameworks of partial algebras, in "Proceedings of CSL'95, 9th International Workshop on Computer Science Logic" (H. Kleine Büning, Ed.), Lecture Notes in Computer Science, Vol. 1092. pp. 403-433, Springer-Verlag, Berlin.
26. Mukund, M. (1992), Petri nets and step transition systems, Internat J. Found. Comput. Sci. 3, 443-478.
27. Nielsen, M., Plotkin, G., and Winskel, G. (1981), Petri Nets. Event Structures and Domains, Part I, Theoret. Comput. Sci. 13, 85-108.
28. Pareigis, B. (1970), "Categories and Functors," Academic Press, San Diego.
29. Petri, C. A. (1962), "Kommunikation mit Automaten," Ph.D. thesis, Institut für Instrumentelle Mathematik, Bonn.
30. Pfender, M. (1974), "Universal Algebra in s-Monoidal Categories," Algebra Berichte 20, Department of Mathematics, University of Munich.
31. Poigné A. (1985), Algebra categorically, in "Category Theory and Computer Programming" (D. Pitt, S. Abramsky, A. Poigné, and D. Rydeheard, Eds.), Lecture Notes in Computer Science, Vol. 240, pp. 76-102, Springer-Verlag, Berlin.
32. Reisig, W. (1985), "Petri Nets: An Introduction," EATCS Monographs on Theoretical Computer Science, Springer-Verlag, Berlin.
33. Sassone, V. (1996), An axiomatization of the algebra of Petri net concatenable processes, Theoret. Comput. Science 170, 277-296.
34. Sassone, V. (1998), An axiomatization of the category of Petri net computations, Math. Struct. Comput. Sci. 8, 117-151.
35. Winskel, G. (1987), Petri nets, algebras, morphisms and compositionality, Inform. and Comput. 72, 197-238.
36. Winskel, G. (1988), An introduction to event structures, in "Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency" (J. W. de Bakker, W.-P. de Roever, and G. Rozenberg, Eds.), Lecture Notes in Computer Science. Vol. 534, pp. 364-397, Springer-Verlag, Berlin.