Factorization properties of symbolic unfoldings of colored Petri nets

DOI10.1007/978-3-642-13675-7_11MaRDI QIDQ3569866zbMATH OpenOpenAlexFDO

Authors Thomas Chatain, Eric Fabre

Publication date 22 June 2010

Published in Applications and Theory of Petri Nets (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-13675-7_11

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2084348
• Optimized Colored Nets Unfolding
• scientific article; zbMATH DE number 1670797
• Foundations of Software Science and Computation Structures
• Faster Unfolding of General Petri Nets Based on Token Flows

Cited in

(9)

• scientific article; zbMATH DE number 1756007 (Why is no real title available?)
• Foundations of Software Science and Computation Structures
• Taking complete finite prefixes to high level, symbolically
• Factorisation of Petri net solvable transition systems
• Methods for Efficient Unfolding of Colored Petri Nets
• Modular construction of finite and complete prefixes of Petri net unfoldings
• Taking complete finite prefixes to high level, symbolically
• Optimized Colored Nets Unfolding
• scientific article; zbMATH DE number 2084348 (Why is no real title available?)

This page was built for publication: Factorization properties of symbolic unfoldings of colored Petri nets

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