Operational semantics for Petri net components

Theoretical Computer Science

Volumn 379, Issue 1-2, 2007, Pages 1-19

  Groote, Jan Friso ^a   Voorhoeve, Marc ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Bisimulation; Modelling; Petri nets; Process algebra; Semantics; Verification

Indexed keywords

ALGEBRA; COMPUTER SIMULATION; DIFFERENTIATION (CALCULUS); MATHEMATICAL MODELS; MATHEMATICAL TRANSFORMATIONS; SEMANTICS; VERIFICATION;

BISIMULATION; LABELLED NETS; PROCESS ALGEBRA;

PETRI NETS;

EID: 34248226417     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2007.01.003     Document Type: Article

References (20)

1. Autant C., and Schnoebelen Ph. Place bisimulations in Petri nets. In: Jensen K. (Ed). Application and Theory of Petri Nets 1992, 13th. International Conference, Proceedings. Lecture Notes in Computer Science vol. 616 (1992), Springer-Verlag, Berlin 45-61
2. Baeten J.C.M., and Weijland W.P. Process Algebra. Cambridge Tracts in Theoretical Computer Science vol. 18 (1990), Cambridge University Press, Cambridge
3. Baldan P., Corradini A., Ehrig H., and Heckel R. Compositional modeling of reactive systems using open nets. Proceedings CONCUR '01. Lecture Notes in Computer Science vol. 2154 (2001), Springer-Verlag, Berlin 502-518
4. Basten T. Branching bisimilarity is an equivalence indeed!. Information Processing Letters 58 (1996) 141-147
5. Donaldson S.R., Bause F., and Kritzinger P.S. The complexity of Petri net transformations. South African Computer Journal 18 (1996) 45-56
6. Dufourd C., Finkel A., and Schnoebelen P. Reset nets between decidability and undecidability. In: Larsen K., Skyum S., and Winskel G. (Eds). Proceedings ICALP'98. Lecture Notes in Computer Science vol. 1443 (1998), Springer-Verlag, Berlin
7. Fokkink W. Rooted branching bisimulation as a congruence. Journal of Computer and System Sciences 60 1 (2000) 13-37
8. van Glabbeek R.J., and Weijland W.P. Branching time and abstraction in bisimulation semantics. Journal of the ACM 43 3 (1996) 555-600
9. van Glabbeek R.J., and Vaandrager F.W. Petri net models for algebraic theories of concurrency (extended abstract). In: de Bakker J.W., Nijman G., and Treleaven P.C. (Eds). Proceedings PARLE. Lecture Notes in Computer Science vol. 1248 (1987), Springer-Verlag, Berlin
10. Groote J.F., and Vaandrager F.W. Structured operational semantics and bisimulation as a congruence. Information and Computation 100 2 (1992) 202-260
11. van Hee K.M. Information Systems Engineering: A Formal Approach (1994), Cambridge University Press, Cambridge
12. Hennesy M., and Milner R. Algebraic laws for nondeterminism and concurrency. Journal of the ACM 32 1 (1985) 137-161
13. Jensen K. Coloured Petri Nets. Basic Concepts, Analysis Methods and Practical Use. EATCS monographs on Theoretical Computer Science (1992), Springer-Verlag, Berlin
14. Kindler E. A compositional partial order semantics for Petri net components. In: Azéma P., and Balbo G. (Eds). Proceedings ATPN '97. Lecture Notes in Computer Science vol. 1248 (1997), Springer-Verlag, Berlin
15. Kindler E., and Vesper T. ESTL: A temporal logic for events and states. In: Desel J., and Silva M. (Eds). Proceedings ATPN '98. Lecture Notes in Computer Science vol. 1420 (1997), Springer-Verlag, Berlin
16. Koutny M., and Best E. Operational and denotational semantics for the box algebra. Theoretical Computer Science 211 (1999) 1-83
17. Milner R. Communication and Concurrency (1989), Prentice-Hall, London
18. De Nicola R., and Vaandrager F.W. Three logics for branching bisimulation. Journal of the ACM 42 2 (1995) 458-487
19. G.D. Plotkin, A structural approach to operational semantics, Technical Report DAIMI FN-19, Computer Science Dept., Aarhus University, 1981
20. Priese L., and Wimmel H. A uniform approach to true-concurrency and interleaving semantics for Petri nets. Theoretical Computer Science 206 (1998) 219-256