Optimized Colored Nets Unfolding

DOI10.1007/11888116_25MaRDI QIDQ3613080zbMATH OpenOpenAlexFDO

Authors Fabrice Kordon, Alban Linard, Emmanuel Paviot-Adet

Publication date 11 March 2009

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

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

Mathematics Subject Classification ID

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

Recommendations

• Factorization properties of symbolic unfoldings of colored Petri nets
• scientific article; zbMATH DE number 2084348
• Linear-algebraic methods for the description, refinement, and analysis of coloured Petri nets
• scientific article; zbMATH DE number 4028914
• scientific article; zbMATH DE number 1863174

Cites work

• Automatic Symmetry Detection in Well-Formed Nets
• Coloured Petri nets and the invariant-method
• Graph-Based Algorithms for Boolean Function Manipulation
• scientific article; zbMATH DE number 2088658 (Why is no real title available?)
• scientific article; zbMATH DE number 1755148 (Why is no real title available?)
• Myths about the mutual exclusion problem

Cited in

(4)

• Exploiting colored Petri nets to decide on permutation admissibility
• scientific article; zbMATH DE number 2084348 (Why is no real title available?)
• Factorization properties of symbolic unfoldings of colored Petri nets
• Finding Stubborn Sets of Coloured Petri Nets without Unfolding

This page was built for publication: Optimized Colored Nets Unfolding

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