Refinement of coloured petri nets

DOI10.1007/BFB0036175MaRDI QIDQ5055925zbMATH OpenFDO

Authors Eike Best, Thomas Thielke

Publication date 9 December 2022

Published in Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0036175

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3885321 (Why is no real title available?)
• scientific article; zbMATH DE number 107927 (Why is no real title available?)
• scientific article; zbMATH DE number 512822 (Why is no real title available?)
• S-invariant analysis of general recursive Petri boxes

Cited in

(6)

• M-nets: a survey
• General parameterised refinement and recursion for the M-net calculus
• Research on the particular subclass of a class coloured Petri nets
• scientific article; zbMATH DE number 1533828 (Why is no real title available?)
• scientific article; zbMATH DE number 1755147 (Why is no real title available?)
• Methods for Efficient Unfolding of Colored Petri Nets

This page was built for publication: Refinement of coloured petri nets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5055925)