Depth-first iterative-deepening: an optimal admissible tree search
Artificial Intelligence
Design and validation of computer protocols
Design and validation of computer protocols
Validation with guided search of the state space
DAC '98 Proceedings of the 35th annual Design Automation Conference
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
FORTE XII / PSTV XIX '99 Proceedings of the IFIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE XII) and Protocol Specification, Testing and Verification (PSTV XIX)
Efficient Guiding Towards Cost-Optimality in UPPAAL
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Exploring Very Large State Spaces Using Genetic Algorithms
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Discovering State Constraints in DISCOPLAN: Some New Results
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Finding Optimal Solutions to Atomix
KI '01 Proceedings of the Joint German/Austrian Conference on AI: Advances in Artificial Intelligence
ECP '99 Proceedings of the 5th 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)
The FF planning system: fast plan generation through heuristic search
Journal of Artificial Intelligence Research
Taming numbers and durations in the model checking integrated planning system
Journal of Artificial Intelligence Research
Efficient implementation of the plan graph in STAN
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
Fast planning through planning graph analysis
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Pushing the envelope: planning, propositional logic, and stochastic search
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
SPUDD: stochastic planning using decision diagrams
UAI'99 Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence
Artificial Intelligence
Taming numbers and durations in the model checking integrated planning system
Journal of Artificial Intelligence Research
The deterministic part of IPC-4: an overview
Journal of Artificial Intelligence Research
Where "Ignoring delete lists" works: local search topology in planning benchmarks
Journal of Artificial Intelligence Research
Engineering benchmarks for planning: the domains used in the deterministic part of IPC-4
Journal of Artificial Intelligence Research
Modelling mixed discrete-continuous domains for planning
Journal of Artificial Intelligence Research
Journal of Artificial Intelligence Research
Action Planning for Directed Model Checking of Petri Nets
Electronic Notes in Theoretical Computer Science (ENTCS)
Friends or foes? on planning as satisfiability and abstract CNF encodings
Journal of Artificial Intelligence Research
Program model checking via action planning
MoChArt'10 Proceedings of the 6th international conference on Model checking and artificial intelligence
Computing infinite plans for LTL goals using a classical planner
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Fair LTL synthesis for non-deterministic systems using strong cyclic planners
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
The paper presents a structured translation from a static (bounded) subset of PROMELA/SPIN to the planning description language PDDL2.1. It exploits the representation of protocols as communicating finite state machines. First, the state-space representation is defined to handle processes, queues, and shared variables. Second, each basic statement (assignment, input, etc.) is translated into a couple of predicates. The deadlock detection problem is reformulated as an action planning problem and SPIN is compared to two action planners Metric-FF and MIPS on several benchmarks (e.g. leader election, dining philosophers, optical telegraph). The difference to existing approaches is the direct use of planning tools. As a byproduct this introduces refined estimates for improved error detection in directed protocol validation.