Recent advances in unfolding technique

DOI10.1016/j.tcs.2014.07.003zbMath1360.68628MaRDI QIDQ403021

Blai Bonet, Victor Khomenko, Sylvie Thiébaux, Patrik Haslum, Walter Vogler

Publication date: 29 August 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2014.07.003

zbMATH Keywords

Petri net; concurrency; adequate order; unfolding prefix; well-foundedness

Mathematics Subject Classification ID

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

Related Items

Star-topology decoupled state space search, Deadlock detection-oriented unfolding of unbounded Petri nets, ``Truly concurrent and nondeterministic semantics of discrete-time Petri nets, Model checking Petri nets with MSVL, Branching Processes of Timed Petri Nets, Efficient Trace Encodings of Bounded Synthesis for Asynchronous Distributed Systems

Cites Work

• Branching processes of Petri nets
• An improvement of McMillan's unfolding algorithm
• Canonical prefixes of Petri net unfoldings
• Unfoldings: A partial-order approach to model checking.
• Directed Unfolding of Petri Nets
• Behaviour-Preserving Transition Insertions in Unfolding Prefixes
• A New Type of Behaviour-Preserving Transition Insertions in Unfolding Prefixes
• Planning as heuristic search
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item