Skip to main content

Experimental Evaluation of a Planning Language Suitable for Formal Verification

  • Conference paper
Model Checking and Artificial Intelligence (MoChArt 2008)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 5348))

Included in the following conference series:

  • 344 Accesses

Abstract

The marriage of model checking and planning faces two seemingly diverging alternatives: the need for a planning language expressive enough to capture the complexity of real-life applications, as opposed to a language simple, yet robust enough to be amenable to exhaustive verification and validation techniques. In an attempt to reconcile these differences, we have designed an abstract plan description language, ANMLite, inspired from the Action Notation Modeling Language (ANML). We present the basic concepts of the ANMLite language as well as an automatic translator from ANMLite to the model checker SAL (Symbolic Analysis Laboratory). We discuss various aspects of specifying a plan in terms of constraints and explore the implications of choosing a robust logic behind the specification of constraints, rather than simply propose a new planning language. Additionally, we provide an initial assessment of the efficiency of model checking to search for solutions of planning problems. To this end, we design a basic test benchmark and study the scalability of the generated SAL models in terms of plan complexity.

Research funding was provided by the National Aeronautics and Space Administration under the cooperative agreement NCC-1-02043.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Allen, J.F., Ferguson, G.: Actions and Events in Interval Temporal Logic. Technical Report TR521, University of Rochester (1994)

    Google Scholar 

  2. Bedrax-Weiss, T., McGann, C., Bachmann, A., Edington, W., Iatauro, M.: EUROPA2: User and Contributor Guide. Technical report, NASA Ames Research Center, Moffett Field, CA (February 2005)

    Google Scholar 

  3. Butler, R.W., Muñoz, C.A.: An Abstract Plan Preparation Language. Report 214518, NASA Langley, Hampton VA 23681-2199, USA (2006)

    Google Scholar 

  4. Butler, R.W., Siminiceanu, R.I., Muño, C.A.: The ANMLite language and logic for specifying planning problems. Report 215088, NASA Langley, Hampton VA 23681-2199, USA (November 2007)

    Google Scholar 

  5. Cimatti, A., Giunchiglia, F., Giunchiglia, E., Traverso, P.: Planning via model checking: a decision procedure for AR. In: Steel, S. (ed.) ECP 1997. LNCS (LNAI), vol. 1348, pp. 130–142. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  6. de Moura, L., Dutertre, B.: Yices 1.0: An Efficient SMT Solver. Technical report, SRI International, SMCOMP (2006), http://yices.csl.sri.com

  7. de Moura, L., Owre, S., Shankar, N.: The SAL Language Manual. Technical Report SRI-CSL-01-02, CSL Technical Report (2003)

    Google Scholar 

  8. Drusinsky, D., Watney, G.: Applying Run-Time Monitoring to the Deep-Impact Fault Protection Engine. In: 28th IEEE/NASA Software Engineering Workshop, p. 127 (2003)

    Google Scholar 

  9. Edelkamp, S.: Heuristic search planning with BDDs. In: PuK (2000)

    Google Scholar 

  10. Feather, M.S., Smith, B.: Automatic Generation of Test Oracles – From Pilot Studies to Application. Automated Software Eng. 8(1), 31–61 (2001)

    Article  MATH  Google Scholar 

  11. Ferraris, P., Giunchiglia, E.: Planning as satisfiability in nondeterministic domains. In: AAAI, pp. 748–753 (2000)

    Google Scholar 

  12. Frank, J., Jonsson, A.: Constraint-based Attribute and Interval Planning. Journal of Constraints 8, 339–364 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  13. Hoey, J., St-Aubin, R., Hu, A., Boutilier, C.: SPUDD: Stochastic planning using decision diagrams. In: Uncertainty in Artificial Intelligence (UAI 1999), pp. 279–288 (1999)

    Google Scholar 

  14. Lomuscio, A., Pecheur, C., Raimondi, F.: Automatic Verification of Knowledge and Time with NuSMV. In: IJCAI, pp. 1384–1389 (2007)

    Google Scholar 

  15. Drew McDermott and AIPS 1998 IPC Committee. PDDL – the Planning Domain Definition Language. Technical report, Yale University (1998)

    Google Scholar 

  16. Owre, S., Shankar, N.: Formal Analysis Methods for Spacecraft Autonomy, Final Report. Technical Report SRI-17625, SRI International (2007)

    Google Scholar 

  17. Pecheur, C., Raimondi, F.: Symbolic model checking of logics with actions. In: Edelkamp, S., Lomuscio, A. (eds.) MoChArt IV. LNCS, vol. 4428, pp. 113–128. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  18. Sheini, H.M., Peintner, B., Sakallah, K.A., Pollack, M.E.: On solving soft temporal constraints using SAT techniques. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 607–621. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  19. Smith, D.E., Frank, J., Jonsson, A.K.: Bridging the Gap between Planning and Scheduling. The Knowledge Engineering Rev. 15(1), 113–128 (2000)

    Article  Google Scholar 

  20. Smith, D.E., Frank, J., McGann, C.: The ANML Language. Technical report, NASA Ames, unpublished report (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Siminiceanu, R.I., Butler, R.W., Muñoz, C.A. (2009). Experimental Evaluation of a Planning Language Suitable for Formal Verification. In: Peled, D.A., Wooldridge, M.J. (eds) Model Checking and Artificial Intelligence. MoChArt 2008. Lecture Notes in Computer Science(), vol 5348. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00431-5_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-00431-5_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-00430-8

  • Online ISBN: 978-3-642-00431-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics