The Power of Hybrid Acceleration

This paper addresses the problem of computing symbolically the set of reachable configurations of a linear hybrid automaton. A solution proposed in earlier work consists in exploring the reachable configurations using an acceleration operator for computing the iterated effect of selected control cycles. Unfortunately, this method imposes a periodicity requirement on the data transformations labeling these cycles, that is not always satisfied in practice. This happens in particular with the important subclass of timed automata, even though it is known that the paths of such automata have a periodic behavior. The goal of this paper is to broaden substantially the applicability of hybrid acceleration. This is done by introducing powerful reduction rules, aimed at translating hybrid data transformations into equivalent ones that satisfy the periodicity criterion. In particular, we show that these rules always succeed in the case of timed automata. This makes it possible to compute an exact symbolic representation of the set of reachable configurations of a linear hybrid automaton, with a guarantee of termination over the subclass of timed automata. Compared to other known solutions to this problem, our method is simpler, and applicable to a much larger class of systems.

[1]  Wang Yi,et al.  On Clock Difference Constraints and Termination in Reachability Analysis of Timed Automata , 2003, ICFEM.

[2]  Volker Weispfenning,et al.  Mixed real-integer linear quantifier elimination , 1999, ISSAC '99.

[3]  L. Fribourg.  A Closed − Form Evaluation for Extended Timed Automata Research Report LSV , 1998 .

[4]  Bernard Boigelot,et al.  An Improved Reachability Analysis Method for Strongly Linear Hybrid Systems (Extended Abstract) , 1997, CAV.

[5]  Hubert Comon-Lundh,et al.  Multiple Counters Automata, Safety Analysis and Presburger Arithmetic , 1998, CAV.

[6]  Thomas A. Henzinger,et al.  The Algorithmic Analysis of Hybrid Systems , 1995, Theor. Comput. Sci..

[7]  Thomas A. Henzinger,et al.  The theory of hybrid automata , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[8]  Pierre Wolper,et al.  An Effective Decision Procedure for Linear Arithmetic with Integer and Real Variables , 2003, ArXiv.

[9]  Patricia Bouyer,et al.  Diagonal Constraints in Timed Automata: Forward Analysis of Timed Systems , 2005, FORMATS.

[10]  Hubert Comon-Lundh,et al.  Timed Automata and the Theory of Real Numbers , 1999, CONCUR.

[11]  Bernard Boigelot.  Symbolic Methods for Exploring Infinite State Spaces , 1998 .

[12]  Patricia Bouyer,et al.  Untameable Timed Automata! , 2003, STACS.

[13]  Pierre Wolper,et al.  An effective decision procedure for linear arithmetic over the integers and reals , 2005, TOCL.

[14]  E. W. Ng.  Symbolic and Algebraic Computation , 1979, Lecture Notes in Computer Science.

[15]  Laure Petrucci,et al.  FAST: Fast Acceleration of Symbolikc Transition Systems , 2003, CAV.

[16]  Peter Z. Revesz,et al.  A Closed-Form Evaluation for Datalog Queries with Integer (Gap)-Order Constraints , 1993, Theor. Comput. Sci..

[17]  Sébastien Jodogne,et al.  Hybrid Acceleration Using Real Vector Automata (Extended Abstract) , 2003, CAV.

[18]  C. A. Petri,et al.  Concurrency Theory , 1986, Advances in Petri Nets.