Communicating sequential processes
Communicating sequential processes
Symbolic Boolean manipulation with ordered binary-decision diagrams
ACM Computing Surveys (CSUR)
Symbolic model checking: an approach to the state explosion problem
Symbolic model checking: an approach to the state explosion problem
Mathematical logic for computer science
Mathematical logic for computer science
First-order logic and automated theorem proving (2nd ed.)
First-order logic and automated theorem proving (2nd ed.)
The B-book: assigning programs to meanings
The B-book: assigning programs to meanings
Software engineering with B
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
Model checking
Prolog (3rd ed.): programming for artificial intelligence
Prolog (3rd ed.): programming for artificial intelligence
Symbolic Model Checking
ECP '99 Proceedings of the 5th European Conference on Planning: Recent Advances in AI Planning
Strong Cyclic Planning Revisited
ECP '99 Proceedings of the 5th European Conference on Planning: Recent Advances in AI Planning
Combining CSP and b for specification and property verification
FM'05 Proceedings of the 2005 international conference on Formal Methods
Directed model checking for B: an evaluation and new techniques
SBMF'10 Proceedings of the 13th Brazilian conference on Formal methods: foundations and applications
| Hi-index | 0.01 |
In this paper we investigate the feasibility of using two different model-checking techniques for solving a number of classical AI planning problems. The ProB model checker, based on mathematical set theory and first-order logic, is specifically designed to validate specifications of concurrent programs written in the B specification language. ProB uses a constraint logic programming environment to perform model checking. NuSMV is the other model checker used in this work. It is an extension of SMV and makes use of symbolic model checking techniques to deal with the state explosion problem common to model checking in general. The problem is represented using Binary Decision Diagrams and model checking is performed using tableaux theorem proving techniques. The scope of the problems chosen is currently limited but it is envisaged that the methodology proposed could usefully be extended to larger planning problems.