• Citer

General parameterised refinement and recursion for the M-net calculus

par Devillers, Raymond ;Klaudel, Hanna;Riemann, Robert-C.
Référence Theoretical computer science, 300, 1-3, page (259-300)
Publication Publié, 2003-05

Article révisé par les pairs

• Détails
• Contenu

Résumé :

The general parametrized refinement and recursion for the M-net calculus were discussed. It was found that algebra of M-nets was introduced in order to cope with the size problem of the low-level Petri box calculus. The analysis showed that the unrestricted and parametrized refinement and recursion operators, allowing to represent the procedure call mechanism were also introduced into the M-net calculus.