A New Class of Decidable Hybrid Systems

One of the most important analysis problems of hybrid systems is the reachability problem. State of the art computational tools perform reachability computation for timed automata, multirate automata, and rectangular automata. In this paper, we extend the decidability frontier for classes of linear hybrid systems, which are introduced as hybrid systems with linear vector fields in each discrete location. This result is achieved by showing that any such hybrid system admits a finite bisimulation, and by providing an algorithm that computes it using decision methods from mathematical logic.

[1]  S. Shankar Sastry,et al.  O-Minimal Hybrid Systems , 2000, Math. Control. Signals Syst..

[2]  George J. Pappas,et al.  Decidable Hybrid Systems , 1998 .

[3]  V. Weispfenning.  A New Approach to Quantifier Elimination for Real Algebra , 1998 .

[4]  S. Shankar Sastry,et al.  Conflict resolution for air traffic management: a study in multiagent hybrid systems , 1998, IEEE Trans. Autom. Control..

[5]  L. Dries,et al.  On the real exponential field with restricted analytic functions , 1994 .

[6]  Pravin Varaiya,et al.  Decidability of Hybrid Systems with Rectangular Differential Inclusion , 1994, CAV.

[7]  Thomas Sturm,et al.  REDLOG: computer algebra meets computer logic , 1997, SIGS.

[8]  A. Wilkie.  Model completeness results for expansions of the ordered field of real numbers by restricted Pfaffian functions and the exponential function , 1996 .

[9]  L. van den Dries,et al.  Tame Topology and O-minimal Structures , 1998 .

[10]  L. Dries,et al.  On the real exponential field with restricted analytic functions , 1995 .

[11]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[12]  George J. Pappas,et al.  Reachability computation for linear hybrid systems , 1999 .

[13]  A. Tarski.  A Decision Method for Elementary Algebra and Geometry , 2023 .

[14]  George E. Collins,et al.  Cylindrical Algebraic Decomposition I: The Basic Algorithm , 1984, SIAM J. Comput..

[15]  George J. Pappas,et al.  Con ict Resolution for Air Tra c Management: a Study in Multi-Agent Hybrid Systems , 1997 .

[16]  Pravin Varaiya,et al.  What's decidable about hybrid automata? , 1995, STOC '95.

[17]  Thomas A. Henzinger,et al.  Hybrid Automata with Finite Bisimulatioins , 1995, ICALP.

[18]  Pravin Varaiya,et al.  Reach Set Computation Using Optimal Control , 2000 .

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