Marie-Odile Cordier and Alban Grastien and Christine Largouët and Yannick Pencolé Efficient trajectories computing exploiting inversibility properties , DX'03 (International workshop on principles of Diagnosis) , Washington , 93--98 , June , 2003 , Document 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. This web site is maintained by René Quiniou using the Weave system from the Caravel project: http://www-caravel.inria.fr. Last modification: 10-07-2011 09:54:25