Planning as model checking

Hörne, Tertia; Poll, John Andrew van der

doi:10.1145/1456659.1456673

Cited by 8 publications

(1 citation statement)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In more or less completed jobs, automatic scheduling is seen as a model checking problem. For example, the work described in [10] explores the use of two model-checkers ProB and NuSMV for modeling and solving planning problems. It empirically compares these two model-checkers on five planning problems described by B (for ProB) and BDD (Binary Decision Diagrams for NuSMV).…”

Section: Related Workmentioning

confidence: 99%

A correct-by-construction approach for development of reliable planning problems

Ammar,

Sakka Rouis,

Bhiri

2024

Journal of Logic and Computation

View full text Add to dashboard Cite

The automated planning community has developed a defacto standard planning language called PDDL. Using the PDDL tools, the reliability of PDDL descriptions can only be posterior examined. However, the Event-B method supports a rich refinement technique that is mathematically proven. Indeed, the Event-B method relies on a first-order predicates language and sets (including mathematical functions and relations) to model the data and on a simple action language to model the treatments. A model described in Event-B includes static modeling elements (sets, constants, axioms and theorems) and dynamic modeling elements (variables, invariant properties and events). Moreover, the Event-B method allows the step-by-step correct construction of Event-B models. To specify and solve the planning problems, a development process based on the combination of Event-B and PDDL is proposed. Our development process favors the obtaining of reliable PDDL description from an ultimate Event-B model using our Event-B2PDDL Eclipse plugin. Our process is successfully experimented on the sliding puzzle game.

show abstract

Section: Related Workmentioning

confidence: 99%

A correct-by-construction approach for development of reliable planning problems

Ammar,

Sakka Rouis,

Bhiri

2024

Journal of Logic and Computation

View full text Add to dashboard Cite

show abstract

Automatic Processing of Planning Problems: Application on Representative Case Studies

Ammar

Rouis

Bhiri

et al. 2022

Advances in Computational Collective Intelligence

View full text Add to dashboard Cite

Symbolic Reachability Analysis of B Through ProB and LTSmin

Bendisposto

Körner

Leuschel

et al. 2016

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We present a symbolic reachability analysis approach for B that can provide a significant speedup over traditional explicit state model checking. The symbolic analysis is implemented by linking ProB to LTSmin, a high-performance language independent model checker. The link is achieved via LTSmin's Pins interface, allowing ProB to benefit from LTSmin's analysis algorithms, while only writing a few hundred lines of glue-code, along with a bridge between ProB and C using ØMQ. ProB supports model checking of several formal specification languages such as B, Event-B, Z and Tla + . Our experiments are based on a wide variety of B-Method and Event-B models to demonstrate the efficiency of the new link. Among the tested categories are state space generation and deadlock detection; but action detection and invariant checking are also feasible in principle. In many cases we observe speedups of several orders of magnitude. We also compare the results with other approaches for improving model checking, such as partial order reduction or symmetry reduction. We thus provide a new scalable, symbolic analysis algorithm for the B-Method and Event-B, along with a platform to integrate other model checking improvements via LTSmin in the future.

show abstract

Planning as model checking

Cited by 8 publications

References 5 publications

A correct-by-construction approach for development of reliable planning problems

A correct-by-construction approach for development of reliable planning problems

Automatic Processing of Planning Problems: Application on Representative Case Studies

Symbolic Reachability Analysis of B Through ProB and LTSmin

Contact Info

Product

Resources

About