A class of composable high level Petri nets

DOI10.1007/3-540-60029-9_36zbMath1496.68216OpenAlexW158964567MaRDI QIDQ5096360

Wojciech Fraczak, Hanna Klaudel, Eike Best, Hans Fleischhack, Richard P. Hopkins, Elisabeth Pelz

Publication date: 16 August 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60029-9_36

Mathematics Subject Classification ID

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

Related Items (7)

Communication as unification in the Petri Box Calculus ⋮ The ins and outs of Petri net composition ⋮ High level expressions with their SOS semantics ⋮ General parameterised refinement and recursion for the M-net calculus ⋮ Petri boxes and finite precedence ⋮ Linear constraint systems as high-level nets ⋮ M-nets: a survey

Cites Work

• Petri nets and algebraic specifications
• A calculus of communicating systems
• M-nets: An algebra of high-level Petri-nets, with an application to the semantics of concurrent programming languages
• Modular Analysis of Petri Nets
• Free Choice Petri Nets
• Model checking using net unfoldings
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A class of composable high level Petri nets