Directed Unfolding of Petri Nets

DOI10.1007/978-3-540-89287-8_11zbMath1171.68562OpenAlexW1546930884MaRDI QIDQ3599218

Sarah L. Hickmott, Patrik Haslum, Sylvie Thiébaux, Blai Bonet

Publication date: 3 February 2009

Published in: Transactions on Petri Nets and Other Models of Concurrency I (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-89287-8_11

Mathematics Subject Classification ID

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

Related Items (9)

Branching Processes of Timed Petri Nets ⋮ Recent advances in unfolding technique ⋮ Fast and accurate data-driven goal recognition using process mining techniques ⋮ Deadlock detection-oriented unfolding of unbounded Petri nets ⋮ ``Truly concurrent and nondeterministic semantics of discrete-time Petri nets ⋮ Star-topology decoupled state space search ⋮ Effective optimization with weighted automata on decomposable trees ⋮ Unnamed Item ⋮ A lazy query scheme for reachability analysis in Petri nets

Cites Work

• Using regression-match graphs to control search in planning
• The computational complexity of propositional STRIPS planning
• Model checking using net unfoldings
• An improvement of McMillan's unfolding algorithm
• Canonical prefixes of Petri net unfoldings
• Connections between cutting-pattern sequencing, VLSI design, and flexible machines
• On the well-foundedness of adequate orders used for construction of complete unfolding prefixes
• Diagnosis of asynchronous discrete-event systems: a net unfolding approach
• Planning as heuristic search
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Directed Unfolding of Petri Nets