Flexible Plan Verification: Feasibility Results

Abstract

Timeline-based planning techniques have demonstrated wide application possibilities in heterogeneous domains. However, a problem for a wider diffusion of such technology still stems in the reduced community that has been studying formal properties of this planning approach. In this sense, we are currently studying the connection between plan generation and execution from the particular perspective of verifying a flexible plan before its actual execution. Nevertheless, a complexity issue should be considered. In fact, validation and verification processes usually exploit formal methods, such as model-checking, that present hard complexity. In this work, we explore how a model-checking verification tool, based on UPPAAL-TIGA, is suitable for verifying flexible temporal plans. In particular, we show the feasibility of our own approach by reporting some preliminary empirical results gathered in a real-world case study.

Dynamic controllability via Timed Game Automata

“…Such constraints may relate the starting or ending times of the source and target nodes in any combination. For example, the dashed edge labeled by E [7,14]E specifies that the end of the Emergency Treatment task must occur between 7 and 14 min after the end of the × Emerg.? connector.…”

Decision-Theoretic Planning with Fuzzy Notions in GOLOG

“…Here we want to investigate how our work can be married with the work of Fritz and McIlraith 10 and Bienvenu et al 1 who compile modal logic preference formulas into Golog programs. Similarly, we will have a look into the works by Finzi and Pirri 9 and Cesta et al 3 who use temporal interval planning to solve scheduling problems.…”

Using Timed Game Automata to Synthesize Execution Strategies for Simple Temporal Networks with Uncertainty

“…TGAs have also been used to validate timeline-based plans (Cesta et al 2011;Orlandini et al 2011). Each plan is encoded as a TGA that includes an uncontrollable observer that plays the role of the environment.…”