inria-00000523, version 1
Efficient trajectories computing using inversibilities properties
Marie-Odile Cordier
a, 1Alban Grastien
1Christine Largouët 1Yannick Pencolé 2
14th international workshop on principles of diagnosis (2003)
Résumé : 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 – INSA Rennes – Université de Rennes 1
- 2 : Austalian National University
- Australian National University
- Domaine : Informatique/Intelligence artificielle
- inria-00000523, version 1
- http://hal.inria.fr/inria-00000523
- oai:hal.inria.fr:inria-00000523
- Contributeur : Alban Grastien
- Soumis le : Jeudi 27 Octobre 2005, 16:44:49
- Dernière modification le : Mercredi 10 Janvier 2007, 11:51:28






Documents associés
Exporter