General parameterised refinement and recursion for the M-net calculus

  • Authors:
  • Raymond Devillers;Hanna Klaudel;Robert-C. Riemann

  • Affiliations:
  • Dép. d'Informatique, CP212, Faculté des Sciences, Université Libre de Bruxelles, Boulevard du Triomphe, B-1050 Brussels, Belgium;Université Paris XII, Créteil, France;Software Design & Management, Müünchen, Germany

  • Venue:
  • Theoretical Computer Science
  • Year:
  • 2003

Quantified Score

Hi-index 5.23

Visualization

Abstract

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.