General parameterised refinement and recursion for the M-net calculus

DOI10.1016/S0304-3975(02)00088-9zbMath1028.68092OpenAlexW2092169056MaRDI QIDQ1399968

Robert-C. Riemann, Hanna Klaudel, Raymond Devillers

Publication date: 30 July 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00088-9

zbMATH Keywords

recursionrefinementPetri netM-netPetri box

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (4)

General parameterised refinement and recursion for the M-net calculus ⋮ Hume box calculus: Robust system development through software transformation ⋮ A compositional Petri net translation of general \(\pi\)-calculus terms ⋮ M-nets: a survey

Uses Software

• M-nets
• PEP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• M-nets: An algebra of high-level Petri-nets, with an application to the semantics of concurrent programming languages
• General parameterised refinement and recursion for the M-net calculus
• S-invariant analysis of general recursive Petri boxes
• Solving recursive net equations
• Communication as unification in the Petri Box Calculus
• Refinement of coloured petri nets
• A class of composable high level Petri nets

This page was built for publication: General parameterised refinement and recursion for the M-net calculus