Compositional modeling of reactive systems using open nets

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

Volumn 2154, Issue , 2001, Pages 502-518

  Baldan, P ^a   Corradini, A ^a   Ehrig, H ^b   Heckel, R ^c  

^a UNIVERSITY OF PISA   (Italy)

^b TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^c UNIVERSITY OF PADERBORN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

METALS; SEMANTICS;

ALGEBRAIC SPECIFICATIONS; APPLICATION FIELDS; COMPOSITIONAL MODELING; CONCURRENT SEMANTICS; CONCURRENT SYSTEMS; INTER-ORGANIZATIONAL WORKFLOWS; PROCESS SEMANTICS; REACTIVE SYSTEM;

PETRI NETS;

EID: 84944061023     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44685-0_34     Document Type: Conference Paper

References (19)

1. P. Baldan, A. Corradini, H. Ehrig, and R. Heckel. Compositional modeling of reactive systems using open nets [extended version]. The paper can be downloaded at the address http://www.di.unipi.it/~baldan/Papers/Soft-copy-ps/open-ext.ps.gz, 2001.
2. E. Best, R. Devillers, and J. G. Hall. The Petri box calculus: a new causal algebra with multi-label communication. In G. Rozemberg, editor, Advances in Petri Nets, volume 609 of LNCS, pages 21–69. Springer Verlag, 1992.
3. A. Corradini. Concurrent graph and term graph rewriting. In U. Montanari and V. Sassone, editors, Proceedings of CONCUR’96, volume 1119 of LNCS, pages 438–464. Springer Verlag, 1996.
4. H. Ehrig and B. Mahr. Fundamentals of Algebraic Specification 1. Springer Verlag, Berlin, 1985.
5. U. Golz and W. Reisig. The non-sequential behaviour of Petri nets. Information and Control, 57:125–147, 1983.
6. R. Heckel. Open Graph Transformation Systems: A New Approach to the Compositional Modelling of Concurrent and Reactive Systems. PhD thesis, TU Berlin, 1998.
7. E. Kindler. A compositional partial order semantics for Petri net components. In P. Azema and G. Balbo, editors, Application and Theory of Petri Nets, volume 1248 of LNCS, pages 235–252. Springer Verlag, 1997.
8. M. Koutny and E. Best. Operational and denotational semantics for the box algebra. Theoretical Computer Science, 211(1–2):1–83, 1999.
9. M. Koutny, J. Esparza, and E. Best. Operational semantics for the Petri box calculus. In B. Jonsson and J. Parrow, editors, Proceedings of CONCUR’94, volume 836 of LNCS, pages 210–225. Springer Verlag, 1994.
10. J. Meseguer and U. Montanari. Petri nets are monoids. Information and Computation, 88:105–155, 1990.
11. M. Nielsen, G. Plotkin, and G. Winskel. Petri Nets, Event Structures and Domains, Part 1. Theoretical Computer Science, 13:85–108, 1981.
12. M. Nielsen, L. Priese, and V. Sassone. Characterizing Behavioural Congruences for Petri Nets. In Proceedings of CONCUR’95, volume 962 of LNCS, pages 175–189. Springer Verlag, 1995.
13. J. Padberg, H. Ehrig, and L. Ribeiro. Algebraic high-level net transformation systems. Mathematical Structures in Computer Science, 5(2):217–256, 1995.
14. J. Padberg, L. Jansen, R. Heckel, and H. Ehrig.: Interoperability in train control systems: Specification of scenarios using open nets. In Proc. IDPT, pages 17–28. Society for Design and Process Science, 1998.
15. L. Priese and H. Wimmel. A uniform approach to true-concurrency and interleaving semantics for Petri nets. Theoretical Computer Science, 206(1–2):219–256, 1998.
16. W. Reisig. Petri Nets: An Introduction. EACTS Monographs on Theoretical Computer Science. Springer Verlag, 1985.
17. W. van der Aalst. The application of Petri nets to workflow management. The Journal of Circuits, Systems and Computers, 8(1):21–66, 1998.
18. W. van der Aalst. Interorganizational workflows: An approach based on message sequence charts and Petri nets. System Analysis and Modeling, 34(3):335–367, 1999.
19. G. Winskel. Event Structures. In Petri Nets: Applications and Relationships to Other Models of Concurrency, volume 255 of LNCS, pages 325–392. Springer Verlag, 1987.