Algebraic characterization of petri net pomset semantics

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1243, Issue , 1997, Pages 406-420

  Wimmel, Harro ^a   Priese, Lutz ^a  

^a University of Koblenz   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 21744459176     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63141-0_28     Document Type: Conference Paper

References (14)

1. E. Best, C. Fernandéz, “Nonsequential Processes: A Petri Net View”, Monographs on Theoretical Computer Science Vol. 13, Springer Verlag, 1988.
2. J.W. de Bakker, J.H.A. Waxmerdam, “Metric Pomset Semantics for a Concurrent Language with Recursion”, Lecture Notes in Computer Science Vol. 469, Springer Verlag, 1990.
3. P. Degano, J. Meseguer, U. Montastari, “Axiomatizing the algebra of net computations and processes”, Acta Informatica 33, pp.641-667, 1996.
4. J. Esparza, “More infinite results”, Proceedings of INFINITY, First International Workshop on Verification of Infinite State Systems, pp.4-20, 1996.
5. S.A. Greibach, “Remarks on Blind and Partially Blind One-Way Multicounter Machines”, Theoretical Computer Science Vol. 7, pp. 311-324, 1978.
6. M. Hack, “Petri Net Languages”, Computation Structures Group Memo 124, Project MAC, M.I.T., 1975.
7. M. Jantzen, “Language Theory of Petri Nets”, Lecture Notes in Computer Science Vol. 254, pp. 397-412, Springer Verlag, 1987.
8. J. Meseguer, U. Montanari, V. Sassone, “Process versus unfolding semantics for Place/Transition Petri nets”, Theoretical Computer Science Vol. 153, pp. 171-210, 1996.
9. M. Nielsen, L. Priese, V. Sassone, “Characterizing Behavioural Congruences for Petri Nets”, Lecture Notes in Computer Science Vol. 962, Proceedings CONCUR '95, eds. I. Lee, S. Smolka, pp. 175-189, 1995.
10. J.L. Peterson, “Petri Nets”, Computing Surveys VoL 9, No. 3, pp. 223-252, 1977.
11. L. Pomello, G. Rozenberg, C. Simone, “A Survey of Equivalence Notions for Net Based Systems”, Lecture Notes in Computer Science Vol. 609, pp.410-472, 1992.
12. L. Priese, H. Wimmel, “A Uniform Approach to True-Concurrency and Interleaving Semantics for Petri Nets”, to appear in Theoretical Computer Science.
13. L. Priese, H. Wimmel, “An Application of Compositional Petri Net Semantics”, Technical Report, Fachberichte Informatik 14/96, Institut für Informatik, Fachbereich Informatik, Universität Koblenz
14. W. Vogler, “Partial Words versus Processes: A Short Comparison”, Lecture Notes in Computer Science Vol. 609, pp. 292-303, 1992.