General parameterised refinement and recursion for the M-net calculus
From MaRDI portal
Publication:1399968
DOI10.1016/S0304-3975(02)00088-9zbMath1028.68092MaRDI 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
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
Hume box calculus: Robust system development through software transformation, A compositional Petri net translation of general \(\pi\)-calculus terms, M-nets: a survey, General parameterised refinement and recursion for the M-net calculus
Uses Software
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