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.

Flexible Plan Verification: Feasibility Results / A., Cesta; A., Finzi; S., Fratini; A., Orlandini; Tronci, Enrico. - (2009). (Intervento presentato al convegno Int, W. on: Experimental evaluation of algorithms for solving problems with combinatorial explosion tenutosi a Reggio Emilia; Italy nel 2009).

Flexible Plan Verification: Feasibility Results

TRONCI, Enrico
2009

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.
2009
Int, W. on: Experimental evaluation of algorithms for solving problems with combinatorial explosion
Algorithms; Combinatorial mathematics; Model checking
04 Pubblicazione in atti di convegno::04b Atto di convegno in volume
Flexible Plan Verification: Feasibility Results / A., Cesta; A., Finzi; S., Fratini; A., Orlandini; Tronci, Enrico. - (2009). (Intervento presentato al convegno Int, W. on: Experimental evaluation of algorithms for solving problems with combinatorial explosion tenutosi a Reggio Emilia; Italy nel 2009).
File allegati a questo prodotto
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11573/378889
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? ND
social impact