A loop acceleration technique to speed up verification of automatically generated plans

  • Robert P. Goldman
  • Michael J. S. Pelican
  • David J. Musliner
VVPS-11

DOI: 10.1007/s10009-013-0284-z

Cite this article as:
Goldman, R.P., Pelican, M.J.S. & Musliner, D.J. Int J Softw Tools Technol Transfer (2014) 16: 13. doi:10.1007/s10009-013-0284-z
  • 91 Downloads

Abstract

The CIRCA planning system automatically creates reactive plans and uses formal verification techniques to prove that those plans will preserve system safety. CIRCA’s timed automata verification system is highly efficient, yet can display pathologically bad behavior when reasoning about reaction loops, a particular form of interacting cycles of states. In this paper, we describe a loop acceleration technique that recognizes these state-space structures during the verification process and bypasses the process of expanding an arbitrarily large cycle of states, effectively compressing loops of arbitrary size into a compact, finite set of states. The resulting performance improvement can be very dramatic: in domains where tight loops of short-duration transitions interact with long-duration transitions, our new loop acceleration methods can reduce verification time (and hence planning time) from hours to below a second.

Keywords

Automated planning Verification Model checking Timed automata Loop acceleration 

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Robert P. Goldman
    • 1
  • Michael J. S. Pelican
    • 1
  • David J. Musliner
    • 1
  1. 1.SIFT, LLCMinneapolisUSA

Personalised recommendations