Portal de Periódicos da CAPES

General parameterised refinement and recursion for the M-net calculus

2003; Elsevier BV; Volume: 300; Issue: 1-3 Linguagem: Inglês

10.1016/s0304-3975(02)00088-9

1879-2294

Raymond Devillers, Hanna Klaudel, Robert-C. Riemann,

Logic, programming, and type systems

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.