s'authentifier
version française rss feed
inria-00000523, version 1
Voir la fiche détaillée  BibTeX  EndNote  TEI  RefWorks
Efficient trajectories computing using inversibilities properties
Marie-Odile Cordier () a1, Alban Grastien () 1, Christine Largouët 1, Yannick Pencolé 2
(2003)
Icone de xclub.pdf
14th international workshop on principles of diagnosis (2003)
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.
a –  Université Rennes I
1 :  DREAM (INRIA - IRISA)
CNRS : UMR6074 – INRIA – Institut National des Sciences Appliquées de Rennes – Université de Rennes 1
2 :  Austalian National University
Australian National University
Informatique/Intelligence artificielle