Analyzing LTL Model Checking Techniques for Plan Synthesis and Controller Synthesis (Work in Progress) | Zendy

Sylvain Kerjean | Zendy; Froduald Kabanza | Zendy; Richard StDenis | Zendy; Sylvie Thiébaux | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Analyzing LTL Model Checking Techniques for Plan Synthesis and Controller Synthesis (Work in Progress)

Author(s) -

Sylvain Kerjean,

Froduald Kabanza,

Richard StDenis,

Sylvie Thiébaux

Publication year - 2006

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2005.07.028

Subject(s) - reachability , model checking , computer science , automaton , plan (archaeology) , heuristic , programming language , controller (irrigation) , theoretical computer science , artificial intelligence , archaeology , biology , agronomy , history

In this paper, we present alternative means of handling invariances in reachability testing, either by formula progression or compilation into Büchi automata. These alternatives are presented in connection with three different applications of model checking: verification, plan synthesis as well as heuristic guidance of AI planning, and controller synthesis. We include results from benchmarks obtained from preparatory experiments with model checking using a family of LTL2Büchi translators and formula progression

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research