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. (C) 2002 Elsevier Science B.V. All rights reserved.
refinement recursion m-net petri net petri box