Heuristics: intelligent search strategies for computer problem solving
Heuristics: intelligent search strategies for computer problem solving
The computational complexity of propositional STRIPS planning
Artificial Intelligence
Model checking using net unfoldings
TAPSOFT '93 Selected papers of the colloquium on Formal approaches of software engineering
Using regression-match graphs to control search in planning
Artificial Intelligence
Artificial Intelligence - Special issue on heuristic search in artificial intelligence
Directed explicit model checking with HSF-SPIN
SPIN '01 Proceedings of the 8th international SPIN workshop on Model checking of software
An Improvement of McMillan's Unfolding Algorithm
Formal Methods in System Design
Connections between cutting-pattern sequencing, VLSI Design, and flexible machines
Computers and Operations Research
Evaluating Deadlock Detection Methods for Concurrent Software
IEEE Transactions on Software Engineering
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Unfolding and Finite Prefix for Nets with Read Arcs
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
LP Deadlock Checking Using Partial Order Dependencies
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Towards an Efficient Algorithm for Unfolding Petri Nets
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Complexity Results for 1-safe Nets
Proceedings of the 13th Conference on Foundations of Software Technology and Theoretical Computer Science
Using Unfoldings to Avoid the State Explosion Problem in the Verification of Asynchronous Circuits
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
Unfolding Based Algorithms for the Reachability Problem
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2000)
On the well-foundedness of adequate orders used for construction of complete unfolding prefixes
Information Processing Letters
A negative result on depth-first net unfoldings
International Journal on Software Tools for Technology Transfer (STTT)
New admissible heuristics for domain-independent planning
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
The FF planning system: fast plan generation through heuristic search
Journal of Artificial Intelligence Research
Planning via Petri net unfolding
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Action Planning for Directed Model Checking of Petri Nets
Electronic Notes in Theoretical Computer Science (ENTCS)
Branching processes of high-level Petri nets
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
On the computation of McMillan's prefix for contextual nets and graph grammars
ICGT'10 Proceedings of the 5th international conference on Graph transformations
A sampling-based approach to identify QoS for web service orchestrations
Proceedings of the 12th International Conference on Information Integration and Web-based Applications & Services
Program model checking via action planning
MoChArt'10 Proceedings of the 6th international conference on Model checking and artificial intelligence
A transactional-qos driven approach for web service composition
RED'10 Proceedings of the Third international conference on Resource Discovery
Hi-index | 0.01 |
The key to efficient on-the-fly reachability analysis based on unfolding is to focus the expansion of the finite prefix towards the desired marking. However, current unfolding strategies typically equate to blind (breadth-first) search. They do not exploit the knowledge of the marking that is sought, merely entertaining the hope that the road to it will be short. This paper investigates directed unfolding , which exploits problem-specific information in the form of a heuristic function to guide the unfolding towards the desired marking. In the unfolding context, heuristic values are estimates of the distance between configurations. We show that suitable heuristics can be automatically extracted from the original net. We prove that unfolding can rely on heuristic search strategies while preserving the finiteness and completeness of the generated prefix, and in some cases, the optimality of the firing sequence produced. We also establish that the size of the prefix obtained with a useful class of heuristics is never worse than that obtained by blind unfolding. Experimental results demonstrate that directed unfolding scales up to problems that were previously out of reach of the unfolding technique.