Zero-safe nets, or transition synchronization made simple

Electronic Notes in Theoretical Computer Science

Volumn 7, Issue , 1997, Pages 55-74

  Bruni, Roberto ^a   Montanari, Ugo ^b  

^a UNIVERSITY OF PISA   (Italy)

^b SRI INTERNATIONAL   (United States)

Author keywords

Abstraction; Collective token philosophy; Petri nets are monoids; Transaction; Transition synchronization

Indexed keywords

COMPUTATIONAL COMPLEXITY; FORMAL LANGUAGES; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; SEMANTICS; SYNCHRONIZATION;

ABSTRACTION; COLLECTIVE TOKEN PHILOSOPHY; PETRI NETS ARE MONOIDS; TRANSACTION; TRANSITION SYNCHRONIZATION;

PETRI NETS;

EID: 0003324470     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(05)80466-9     Document Type: Conference Paper

References (20)

1. Best E., Devillers R. Sequential and Concurrent Behaviour in Petri Net Theory. Theoretical Computer Science. 55:1987;87-136
2. Best E., Devillers R., Hall J. The Box Calculus: A New Causal Algebra with Multi-label Communication. Advances in Petri Nets '92, LNCS, n. 609. 1992;21-69 Springer-Verlag
3. C. Brown and D. Gurr. A Categorical Linear Framework for Petri Nets. In Proceedings of the 5th LICS Symposium, 208-218, 1990.
4. Degano P., Meseguer J., Montanari U. Axiomatizing the Algebra of Net Computations and Processes. Acta Informatica. 33:(7):October 1996;641-667
5. Degano P., de Nicola R., Montanari U. A Distributed Operational Semantics for CCS based on Condition/Event Systems. Acta Informatica. 26:1988;59-91
6. F. Gadducci. On the Algebraic Approach to Concurrent Term Rewriting. PhD thesis TD 02/96, Department of Computer Science, University of Pisa, 1996.
7. F. Gadducci and U. Montanari. The Tile Model. Technical Report TR-96-27, Department of Computer Science, University of Pisa, 1996.
8. Gorrieri R., Montanari U. On the Implementation of Concurrent Calculi into Net Calculi: Two Case Studies. TCS. 141:1995;1-2. 195-252
9. R.J. Van Glabbeek and G.D. Plotkin. Configuration Structures. In D. Kozen, editor, Proceedings of the 10th LICS Symposium, IEEE, pages 199-209, 1995.
10. R. Van Glabbeek and F. Vaandrager. Petri Net Models for Algebraic Theories of Concurrency. In Proceedings of PARLE, LNCS, n. 259, pages 224-242. Springer-Verlag, 1987.
11. Goltz U., Reisig W. The Non-Sequential Behaviour of Petri Nets. Information and Computation. 57:1983;125-147
12. J. Meseguer and U. Montanari Petri Nets are Monoids: A New Algebraic Foundations for Net Theory. Proc. 3rd Symp. on Logics in Computer Science, IEEE 1988:155-164.
13. Meseguer J., Montanari U. Petri Nets are Monoids. Information and Computation. 88:(2):October 1990;105-155
14. Meseguer J., Montanari U., Sassone V. Process versus Unfolding Semantics for Place/Transition Petri Nets. TCS, Volume 153, issue. 1996;1-2. 171-210
15. J. Meseguer, U. Montanari, and V. Sassone. Representation Theorems for Petri Nets. Festschrift in honor of Prof. Wilfried Brauer to appear.
16. Olderog E.R. Operational Petri Net Semantics for CCSP. Rozenberg G. Advances in Petri Nets '87, LNCS, n. 266. 1987;196-223 Springer-Verlag
17. C.A. Petri. Kommunikation mit Automaten. PhD thesis, Institut für Instrumentelle Mathematik, Bonn, Germany, 1962.
18. Reisig W. Petri Nets. 1985;Springer-Verlag
19. G. Winskel. Event Structure Semantics of CCS and Related Languages. In Proceedings of 1C ALP '82, LNCS, n. 140, pages 561-567, Springer-Verlag, 1982.
20. Winskel G. Petri Nets, Algebras, Morphisms and Compositionality. Information and Computation. 72:1987;197-238