Towards an efficient algorithm for unfolding Petri nets

DOI10.1007/3-540-44685-0_25MaRDI QIDQ4791845zbMATH OpenFDO

Authors Victor Khomenko, Maciej Koutny

Publication date 3 February 2003

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2154/21540366.htm

zbMATH Keywords

concurrencymodel checkingPetri netsunfolding

Mathematics Subject Classification ID

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

Recommendations

• Faster Unfolding of General Petri Nets Based on Token Flows
• Unfoldings of unbounded Petri nets
• Goal-driven unfolding of Petri nets
• scientific article; zbMATH DE number 2080061
• scientific article; zbMATH DE number 2088661

Cited in

(27)

• A technique of state space search based on unfolding
• An improvement of McMillan's unfolding algorithm
• Pomsets and unfolding of reset Petri nets
• Star-topology decoupled state space search
• Canonical prefixes of Petri net unfoldings
• Pomset bisimulation and unfolding for reset Petri nets
• Deadlock detection-oriented unfolding of unbounded Petri nets
• Unfoldings of unbounded Petri nets
• Unfolding based alorithms for the reachability problem
• Planning without state space explosion: Petri net to Markov decision process
• Faster Unfolding of General Petri Nets Based on Token Flows
• Directed Unfolding of Petri Nets
• Behaviour-Preserving Transition Insertions in Unfolding Prefixes
• Optimized Colored Nets Unfolding
• Recent advances in unfolding technique
• scientific article; zbMATH DE number 2080061 (Why is no real title available?)
• Unfolding of products of symmetrical Petri nets
• Model checking with finite complete prefixes is PSPACE-complete
• LP deadlock checking using partial order dependencies
• A structural approach for the analysis of Petri nets by reduced unfoldings
• scientific article; zbMATH DE number 1903382 (Why is no real title available?)
• On the computation of McMillan's prefix for contextual nets and graph grammars
• Computing the reveals relation in occurrence nets
• Model checking using net unfoldings
• Goal-driven unfolding of Petri nets
• Applications and Theory of Petri Nets 2004
• Methods for Efficient Unfolding of Colored Petri Nets

This page was built for publication: Towards an efficient algorithm for unfolding Petri nets

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