Efficient trajectories computing using inversibilities properties

Marie-Odile Cordier 1 Alban Grastien 1 Christine Largouët 1 Yannick Pencolé 2
1 DREAM - Diagnosing, Recommending Actions and Modelling
Inria Rennes – Bretagne Atlantique , IRISA-D7 - GESTION DES DONNÉES ET DE LA CONNAISSANCE
Abstract : A time-consuming problem encountered both in system diagnosis and planning is that of computing trajectories over a behavioral model. In order to improve the efficiency of this task, there is currently a great interest in using model-checking techniques developed within the area of computer aided verification. In this paper, we propose to represent the system as automata and we define a property called inversibility. This property is used to improve the efficiency of the search algorithm computing trajectories. We present two study cases in diagnosis and planning domains where this approach gives satisfactory results.
Document type :
Conference papers
Complete list of metadatas

Cited literature [14 references]  Display  Hide  Download

https://hal.inria.fr/inria-00000523
Contributor : Alban Grastien <>
Submitted on : Thursday, October 27, 2005 - 4:44:49 PM
Last modification on : Thursday, June 20, 2019 - 12:04:05 PM
Long-term archiving on : Friday, April 2, 2010 - 6:01:22 PM

Identifiers

  • HAL Id : inria-00000523, version 1

Citation

Marie-Odile Cordier, Alban Grastien, Christine Largouët, Yannick Pencolé. Efficient trajectories computing using inversibilities properties. 14th international workshop on principles of diagnosis, Jun 2003, Washington / USA. ⟨inria-00000523⟩

Share

Metrics

Record views

376

Files downloads

175