Transformations and decompositions of nets
Advances in Petri nets 1986, part I on Petri nets: central models and their properties
ADL: exploring the middle ground between STRIPS and the situation calculus
Proceedings of the first international conference on Principles of knowledge representation and reasoning
The computational complexity of propositional STRIPS planning
Artificial Intelligence
Planning control rules for reactive agents
Artificial Intelligence
Automatic OBDD-based generation of universal plans in non-deterministic domains
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Using temporal logics to express search control knowledge for planning
Artificial Intelligence
Model checking
Artificial Intelligence - Special issue on heuristic search in artificial intelligence
Evaluating Deadlock Detection Methods for Concurrent Software
IEEE Transactions on Software Engineering
Checking properties of nets using transformation
Advances in Petri Nets 1985, covers the 6th European Workshop on Applications and Theory in Petri Nets-selected papers
Deadlock Checking Using Net Unfoldings
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Planning via Model Checking: A Decision Procedure for AR
ECP '97 Proceedings of the 4th European Conference on Planning: Recent Advances in AI Planning
Conformant Planning via Model Checking
ECP '99 Proceedings of the 5th European Conference on Planning: Recent Advances in AI Planning
Directed explicit-state model checking in the validation of communication protocols
International Journal on Software Tools for Technology Transfer (STTT)
Spin model checker, the: primer and reference manual
Spin model checker, the: primer and reference manual
Cost-algebraic heuristic search
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
PDDL2.1: an extension to PDDL for expressing temporal planning domains
Journal of Artificial Intelligence Research
Taming numbers and durations in the model checking integrated planning system
Journal of Artificial Intelligence Research
The metric-FF planning system: translating "Ignoring delete lists" to numeric state variables
Journal of Artificial Intelligence Research
STRIPS: a new approach to the application of theorem proving to problem solving
IJCAI'71 Proceedings of the 2nd international joint conference on Artificial intelligence
Planning as model checking for extended goals in non-deterministic domains
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Artificial Intelligence: A Modern Approach
Artificial Intelligence: A Modern Approach
SPIN'03 Proceedings of the 10th international conference on Model checking software
Directed Unfolding of Petri Nets
Transactions on Petri Nets and Other Models of Concurrency I
Engineering benchmarks for planning: the domains used in the deterministic part of IPC-4
Journal of Artificial Intelligence Research
Planning via Petri net unfolding
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Program model checking via action planning
MoChArt'10 Proceedings of the 6th international conference on Model checking and artificial intelligence
Temporal logic for process specification and recognition
Intelligent Service Robotics
Hi-index | 0.00 |
Petri nets are fundamental to the analysis of distributed systems especially infinite-state systems. Finding a particular marking corresponding to a property violation in Petri nets can be reduced to exploring a state space induced by the set of reachable markings. Typical exploration(reachability analysis) approaches are undirected and do not take into account any knowledge about the structure of the Petri net. This paper proposes heuristic search for enhanced exploration to accelerate the search. For different needs in the system development process, we distinguish between different sorts of estimates. Treating the firing of a transition as an action applied to a set of predicates induced by the Petri net structure and markings, the reachability analysis can be reduced to finding a plan to an AI planning problem. Having such a reduction broadens the horizons for the application of AI heuristic search planning technology. In this paper we discuss the transformations schemes to encode Petri nets into PDDL. We show a concise encoding of general place-transition nets in Level 2 PDDL2.2, and a specification for bounded place-transition nets in ADL/STRIPS. Initial experiments with an existing planner are presented.