General parameterised refinement and recursion for the M-net calculus

The algebra of M-nets, a high-level class of labelled Petri nets, was introduced in order to cope with the size problem of the low-level Petri box calculus, especially when applied as semantical domain for parallel programming languages. General, unrestricted and parameterised refinement and recursion operators, allowing to represent the (possibly recursive and concurrent) procedure call mechanism, are introduced into the M-net calculus.

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

[2]  Maciej Koutny,et al.  Solving Recursive Net Equations , 1995, ICALP.

[3]  Kurt Jensen,et al.  Coloured Petri Nets: Modelling and Validation of Concurrent Systems , 2009 .

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

[5]  Wolfgang Reisig.  Petri Nets: An Introduction , 1985, EATCS Monographs on Theoretical Computer Science.

[6]  Hanna Klaudel,et al.  A Class of Composable High Level Petri Nets with an Application to the Semantics of B(PN)2 , 1995, Application and Theory of Petri Nets.

[7]  Hanna Klaudel Kozlowska.  Modeles algebriques, bases sur les reseaux de petri, pour la semantique des langages de programmation concurrents , 1995 .

[8]  Robert-C. Riemann.  Modelling of concurrent systems: structural and semantical methods in the high level Petri net calculus , 1999 .

[9]  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.

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

[11]  Wojciech Penczek,et al.  A partial order approach to branching time logic model checking , 1995, Proceedings Third Israel Symposium on the Theory of Computing and Systems.

[12]  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.

[13]  Maciej Koutny,et al.  Operational Semantics for the Petri Box Calculus , 1994, CONCUR.

[14]  Kurt Jensen,et al.  Coloured Petri nets (2nd ed.): basic concepts, analysis methods and practical use: volume 1 , 1996 .

[15]  Maciej Koutny,et al.  Partial Order Semantics of Box Expressions , 1994, Application and Theory of Petri Nets.

[16]  Hanna Klaudel,et al.  Communication as Unification in the Petri Box Calculus , 1995, FCT.

[17]  James L. Peterson,et al.  Petri Nets , 1977, CSUR.

[18]  Ursula Goltz,et al.  Refinement of Actions in Causality Based Models , 1990, REX Workshop.

[19]  Hanna Klaudel,et al.  Refinement and Recursion in a High Level Petri Box Calculus , 1995, STRICT.

[20]  Maciej Koutny,et al.  A Refined View of the Box Algebra , 1995, Application and Theory of Petri Nets.

[21]  Hanna Klaudel,et al.  General Refinement in the M-net Calculus: (LIT 357) , 1997 .

[22]  Bernd Grahlmann,et al.  The PEP Tool , 1997, CAV.

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

[24]  Kurt Jensen,et al.  Coloured Petri Nets: Basic Concepts, Analysis Methods and Practical Use. Vol. 2, Analysis Methods , 1992 .

[25]  Eike Best,et al.  Refinement of Coloured Petri Nets , 1997, FCT.

[26]  Hartmann J. Genrich,et al.  Predicate/Transition Nets , 1986, Advances in Petri Nets.

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

[28]  Raymond R. Devillers.  S-invariant analysis of general recursive Petri boxes , 1995 .

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