A Concurrent and Compositional Petri Net Semantics of Preemption

The aim of this paper is the introduction of preemption in a compositional model, called M-nets, which is based on Petri nets and hence provided with a concurrent semantics. We propose a way to model preemptible systems by extending the M-net model with priorities and the M-net algebra with a preemption operator. We show that these extensions can be seen as a high-level version of the well studied model of priority systems, and so, can be reduced to Petri nets (without priorities) which retain as much as possible of the original concurrency. As a consequence, Petri nets appear as a model powerful enough to deal with preemption in a compositional way and with a concurrent semantics.

[1]  Gérard Berry,et al.  The foundations of Esterel , 2000, Proof, Language, and Interaction.

[2]  Maciej Koutny,et al.  Petri Net Semantics of Priority Systems , 1992, Theor. Comput. Sci..

[3]  Hanna Klaudel,et al.  Refinement-based Semantics of Parallel Procedures , 1999, PDPTA.

[4]  Eike Best,et al.  Reducing k -Safe Petri Nets to Pomset-Equivalent 1-Safe Petri Nets , 2000, ICATPN.

[5]  Luciano Lavagno,et al.  Coupling Asynchrony and Interrupts: Place Chart Nets , 1997, ICATPN.

[6]  Richard P. Hopkins,et al.  B(PN)2 - a Basic Petri Net Programming Notation , 1993, PARLE.

[7]  Dieter Hogrefe,et al.  Formale Beschreibungstechniken für verteilte Systeme , 1992 .

[8]  Raymond R. Devillers,et al.  General Refinement for High Level Petri Nets , 1997, FSTTCS.

[9]  Javier Esparza.  Model Checking Using Net Unfoldings , 1994, Sci. Comput. Program..

[10]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[11]  Hanna Klaudel,et al.  M-nets: An algebra of high-level Petri nets, with an application to the semantics of concurrent programming languages , 1998, Acta Informatica.

[12]  Eike Best,et al.  PEP - More than a Petri Net Tool , 1996, TACAS.

[13]  Hanna Klaudel,et al.  An M-net Semantics of B(PN)2 , 1995, STRICT.

[14]  Raymond R. Devillers,et al.  The box calculus: a new causal algebra with multi-label communication , 1992, Advances in Petri Nets: The DEMON Project.

[15]  Hanna Klaudel,et al.  Asynchronous Links in the PBC and M-Nets , 1999, ASIAN.

[16]  Hanna Klaudel.  Parameterized M-expression semantics of parallel procedures , 2000 .

[17]  Hans Fleischhack,et al.  A Petri net semantics for B(PN)/sup 2/ with procedures , 1997, Proceedings of PDSE '97: 2nd International Workshop on Software Engineering for Parallel and Distributed Systems.

[18]  Raymond R. Devillers,et al.  General Refinement and Recursion Operators for the Petri Box Calculus , 1993, STACS.

[19]  Nicolas Halbwachs,et al.  Synchronous Programming of Reactive Systems , 1992, CAV.

[20]  Tobias Vesper,et al.  Automatisches verteiltes Rücksetzen , 1999, FBT.

[21]  Wilfried Brauer,et al.  Net Theory and Applications , 1980, Lecture Notes in Computer Science.

[22]  Hanna Klaudel.  Compositional high-level Petri net semantics of a parallel programming language with procedures , 2001, Sci. Comput. Program..

[23]  Hanna Klaudel,et al.  High Level Expressions with their SOS Semantics (Extended Abstract) , 1997, CONCUR.

[24]  Kurt Lautenbach,et al.  Elements of General Net Theory , 1979, Advanced Course: Net Theory and Applications.