A concurrent and compositional Petri net semantics of preemption

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

Volumn 1945 LNCS, Issue , 2000, Pages 318-337

  Klaudel, Hanna ^a   Pommereau, Franck ^a  

^a UNIVERSITÉ PARIS EST CRÉTEIL   (France)

Author keywords

Compositionality; Concurrency; Petri nets; Preemption

Indexed keywords

PETRI NETS; SEMANTICS;

COMPOSITIONAL MODELING; COMPOSITIONALITY; CONCURRENCY; CONCURRENT SEMANTICS; NET MODEL; PETRI NET SEMANTICS; PREEMPTION;

FORMAL METHODS;

EID: 84894527467     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-40911-4_19     Document Type: Conference Paper

References (23)

1. G. Berry. The Foundations of Esterel. Language and Interaction: Essays in Honour of Robin Milner, G. Plotkin, C. Stirling and M. Tofte, editors, MIT Press, 1998.
2. E. Best, R. Devillers, and J. Esparza. General refinement and recursion operators for the Petri box calculus. LNCS 665:130-140, 1993.
3. E. Best, R. Devillers, and J. G. Hall. The box calculus: A new causal algebra with multi-label communication. LNCS 609:21-69, 1992.
4. E. Best, W. Fraczak, R. Hopkins, H. Klaudel, and E. Pelz. M-nets: An algebra of high-level Petri nets, with an application to the semantics of concurrent programming languages. Acta Informatica, 35, 1998.
5. E. Best and R. P. Hopkins. B(PN)2 - A basic Petri net programming notation. PARLE'93, LNCS 694:379-390, 1993.
6. E. Best and M. Koutny. Petri net semantics of priority systems. Theoretical Computer Science, 96(1):175-215, 1992.
7. E. Best and H. Wimmel. Reducing k-safe Petri nets to pomset-equivalent 1-safe Petri nets. ICATPN'2000, to appear.
8. R. Devillers, H. Klaudel, and R.-C Riemann. General refinement for high-level Petri nets. FST&TCS'97, LNCS 1346:297-311, 1997.
9. H.J. Genrich, K. Lautenbach, and PS. Thiagarajan. Elements of General Net Theory. In W. Brauer, editor, Net Theory and Applications, Proceedings of the Advanced Course on General Net Theory of Processes and Systems, LNCS 84:21- 163, 1980.
10. R. Devillers, H. Klaudel, and R.-C. Riemann. General parameterised refinement and recursion for the M-net calculus. Theoretical Computer Science, to appear.
11. J. Esparza. Model checking using net unfoldings. Science of Computer Programming, 23(2-3): 151-195, 1994.
12. H. Fleishhack and B. Grahlmann. A Petri net semantics for B(PN)2 with procedures. PDSE'97, Boston, 1997. IEEE Computer Society.
13. B. Grahlmann and E. Best. PEP - more than a Petri net tool. LNCS 1055, 1996.
14. N. Halbwachs. Synchronous Programming of Reactive Systems. Kluwer Academic Publishers, 1993.
15. H. Klaudel. Compositional high-level Petri net semantics of a parallel programming language with procedures. Science of Computer Programming, to appear.
16. H. Klaudel. Parametrized M-expression semantics of parallel procedures. DAP- SYS'OO, to appear.
17. H. Klaudel and F. Pomtnereau. Asynchronous links in the PBC and M-nets. ASIAN'99, LNCS 1742:190-200, 1999.
18. H. Klaudel and R.-C. Riemann. High level expressions with their SOS semantics. CONCUR'97, LNCS 1243:288-301, 1997.
19. H. Klaudel and R.-C. Riemann. Refinement-based semantics od parallel procedures. PDPTA'99, volume 4. CSREA Press, 1999.
20. J. Lilius and E. Pelz. An M-net semantics of B(PN)2 with procedures. ISC1S, volume 1, 1996.
21. R. Milner. A calculus of communicating systems. LNCS 92, 1980.
22. T. Vesper and M. Weber. Automatishes verteiltes riichksetzen. In K. Spies and B. Schatz, editors, Proceedings of the workshop "Formale Beschreibungstechniken fur verteilte Systeme", number 9 in GI/ITG Fachgesprach, Munich, 1999.
23. M. Kishinevsky, J. Cortadella, A. Kondratyev, L. Lavagno, A. Taubin and A. Ya- kovlev. Coupling asynchrony and interrupts: place chart nets and their synthesis. ICATPN'97, LNCS 1248:328-347, 1997.