skip to main content
10.1145/1456659.1456673acmotherconferencesArticle/Chapter ViewAbstractPublication PageshtConference Proceedingsconference-collections
research-article

Planning as model checking: the performance of ProB vs NuSMV

Published: 06 October 2008 Publication History

Abstract

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.

References

[1]
Abrial, J.-R. 1996. The B-Book: Assigning programs to meanings. Cambridge University Press.
[2]
Ben-Ari, M. 2001. Mathematical logic for Computer Science, 2 ed. Springer.
[3]
Bratko, I. 2001. Prolog Programming for Artificial Intelligence, 3 ed. Addison-Wesley.
[4]
Bryant, R. 1992. Symbolic boolean manipulation with ordered binary-decision diagrams. ACM Computing Surveys 24, 3, 142--170.
[5]
Butler, M. and Leuschel, M. 2005. Combining CSP and B for Specification and Property Verification. In International Symposium of Formal Methods Europe, J. Fitzgerald, I. Hayes, and A. Tarlecki, Eds. Lecture Notes in Computer Science, vol. 3582. Springer, Heidelberg, 221--236.
[6]
Cavada, R. 2008. Private email communication.
[7]
Cavada, R., Cimatti, A., Jochim, C., Keighren, G., Olivetti, E., Pistore, M., Roveri, M., and Tchaltsev, A. 2005. NuSMV 2.4 User Manual. CMU and ITC-irst.
[8]
Cimatti, A. and Roveri, M. 2000. Conformant Planning vis Symbolic Model Cheking. Tech. rep., ITC-irst, Trento, Italy. Technical Report 0006--04.
[9]
Clarke, E., Grumberg, O., and Peled, D. 1999. Model Checking. MIT Press.
[10]
Daniele, M., Traverso, P., and Vardi, M. 2000. Strong cyclic planning revisited. In Recent Advances in AI Planning. Springer, Heidelberg, 35--48.
[11]
Davis, M. and Putnam, H. 1960. A Computing Procedure for Quantification Theory. Journal of the ACM 7, 1, 201--215.
[12]
Enderton, H. 1977. Elements of Set Theory. Academic Press, Inc.
[13]
Fitting, M. 1996. First-Order Logic and Automated Theorem Proving, 2 ed. Springer.
[14]
Formal Systems Europe Ltd. Failures-Divergence Refinement - FDR User Manual.
[15]
Giunchiglia, F. and Traverso, P. 1999. Planning as Model Checking. In Recent advances in AI Planning. Lecture Notes in Artificial Intelligence, vol. 1809. Springer.
[16]
Giunchiglia, F. and Traverso, P. 2000. A partial order approach to branching time temporal logic model checking. In Proceedings of the 5th European Conference on Planning. Recent Advances in AI Planning. Springer.
[17]
Hoare, C. 1985. Communicating Sequential Processes. Prentice-Hall, Englewood Cliffs, NJ.
[18]
Holzmann, G. 1997. The model checker SPIN. IEEE Transactions on Software Engineering 23, 5, 279--295.
[19]
Leuschel, M. and Butler, M. 2003. ProB: A model checker for B. In FME 2003: Formal Methods. Lecture Notes in Computer Science, vol. 2805. Springer, Heidelberg, 855--874.
[20]
Leuschel, M., Butler, M., and Presti, S. L. 2005. ProB User Manual. University of Southampton, UK.
[21]
Leuschel, M., Massart, T., and Currie, A. 2001. How to Make FDR Spin: LTL Model Checking of CSP by Refinement. In International Symposium of Formal Methods Europe. Lecture Notes in Computer Science, vol. 2021. Springer, 99--118.
[22]
Manzo, M. D., Giunchiglia, E., and Ruffino, S. 1999. Planning via Model Checking in Deterministic Domains: Preliminary Report. In Proceedings of the AIMSA '98 Conference. Number 1480 in Lecture Notes in Artificial Intelligence. Springer, Heidelberg, 221--229.
[23]
Marinagi, C., Panayiotopoulos, T., and Spyropoulos, C. 2005. AI Planning and Intelligent Agents. Idea Group Inc., 225--257.
[24]
McMillan, K. 1992. Symbolic Model Checking: An Approach to the State Explosion Problem. Ph.D. thesis, Carnegie Mellon University.
[25]
McMillan, K. 1993. Symbolic Model Checking. Kluwer Academic Press, Massachusetts.
[26]
Pistore, M. and Traverso, P. 2000. Planning as Model Checking for Extended Goals in Non-deterministic Domains. Tech. rep., ICT-irst, Trento, Italy. Technical Report 0101-03.
[27]
Tatibouet, B. 2001. The JBTools Package. Available at http://lifc.univfcomte.fr/PEOPLE/tatibouet/JBTOOLS/BParseren.html.
[28]
Wallace, M. 1998. Constraint Programming. CRC Press LLC, 17.1--17.17.
[29]
Wordsworth, J. 1996. Software Engineering with B. Addison-Wesley.

Cited By

View all
  • (2022)Automatic Processing of Planning Problems: Application on Representative Case StudiesAdvances in Computational Collective Intelligence10.1007/978-3-031-16210-7_36(436-445)Online publication date: 21-Sep-2022
  • (2020)Reasoning Heuristics for the Theorem-Proving Platform Rodin/Event-B2020 International Conference on Computational Science and Computational Intelligence (CSCI)10.1109/CSCI51800.2020.00332(1800-1806)Online publication date: Dec-2020
  • (2019)A temporal logic programming approach to planningJournal of Combinatorial Optimization10.1007/s10878-019-00389-y38:2(402-420)Online publication date: 31-Jul-2019
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences
SAICSIT '08: Proceedings of the 2008 annual research conference of the South African Institute of Computer Scientists and Information Technologists on IT research in developing countries: riding the wave of technology
October 2008
304 pages
ISBN:9781605582863
DOI:10.1145/1456659
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

  • Microsoft: Microsoft

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 06 October 2008

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. BDDs
  2. constraint logic programming
  3. model checking
  4. planning
  5. satisfiability
  6. tableaux theorem proving

Qualifiers

  • Research-article

Conference

SAICSIT '08
Sponsor:
  • Microsoft

Acceptance Rates

Overall Acceptance Rate 187 of 439 submissions, 43%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)4
  • Downloads (Last 6 weeks)0
Reflects downloads up to 16 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2022)Automatic Processing of Planning Problems: Application on Representative Case StudiesAdvances in Computational Collective Intelligence10.1007/978-3-031-16210-7_36(436-445)Online publication date: 21-Sep-2022
  • (2020)Reasoning Heuristics for the Theorem-Proving Platform Rodin/Event-B2020 International Conference on Computational Science and Computational Intelligence (CSCI)10.1109/CSCI51800.2020.00332(1800-1806)Online publication date: Dec-2020
  • (2019)A temporal logic programming approach to planningJournal of Combinatorial Optimization10.1007/s10878-019-00389-y38:2(402-420)Online publication date: 31-Jul-2019
  • (2016)Symbolic Reachability Analysis of B Through ProB and LTSminProceedings of the 12th International Conference on Integrated Formal Methods - Volume 968110.1007/978-3-319-33693-0_18(275-291)Online publication date: 1-Jun-2016
  • (2012)Planning as Model Checking TasksProceedings of the 2012 35th Annual IEEE Software Engineering Workshop10.1109/SEW.2012.25(177-186)Online publication date: 12-Oct-2012
  • (2011)Directed Model Checking for B: An Evaluation and New TechniquesFormal Methods: Foundations and Applications10.1007/978-3-642-19829-8_1(1-16)Online publication date: 2011
  • (2010)Directed model checking for BProceedings of the 13th Brazilian conference on Formal methods: foundations and applications10.5555/1987100.1987101(1-16)Online publication date: 8-Nov-2010

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media