Finite Bisimulations for Dynamical Systems with Overlapping Trajectories

Having a finite bisimulation is a good feature for a dynamical system, since it can lead to the decidability of the verification of reachability properties. We investigate a new class of o-minimal dynamical systems with very general flows, where the classical restrictions on trajectory intersections are partly lifted. We identify conditions, that we call Finite and Uniform Crossing: When Finite Crossing holds, the time-abstract bisimulation is computable and, under the stronger Uniform Crossing assumption, this bisimulation is finite and definable.

[1]  George J. Pappas,et al.  Discrete abstractions of hybrid systems , 2000, Proceedings of the IEEE.

[2]  Gregory J. Chaitin,et al.  A recent technical report , 1974, SIGA.

[3]  Charles Steinhorn,et al.  Tame Topology and O-Minimal Structures , 2008 .

[4]  S. Shankar Sastry,et al.  Hybrid Systems with Finite Bisimulations , 1997, Hybrid Systems.

[5]  D. Marker.  Model theory : an introduction , 2002 .

[6]  Serge Haddad,et al.  Polynomial Interrupt Timed Automata , 2015, RP.

[7]  S. Shankar Sastry,et al.  Subanalytic Stratifications and Bisimulations , 1998, HSCC.

[8]  Thomas Brihaye,et al.  On O-Minimal Hybrid Systems , 2004, HSCC.

[9]  A. Pillay,et al.  DEFINABLE SETS IN ORDERED STRUCTURES. I , 1986 .

[10]  Jennifer M. Davoren,et al.  Topologies, continuity and bisimulations , 1999, RAIRO Theor. Informatics Appl..

[11]  Thomas Brihaye.  Verification and control of o-minimal hybrid systems and weighted timed automata , 2006 .

[12]  Xin Chen,et al.  Taylor Model Flowpipe Construction for Non-linear Hybrid Systems , 2012, 2012 IEEE 33rd Real-Time Systems Symposium.

[13]  Emmanuel Hainry,et al.  Reachability in Linear Dynamical Systems , 2008, CiE.

[14]  Angus Macintyre,et al.  On the decidability of the real exponential field , 1996 .

[15]  Ashish Tiwari,et al.  Series of Abstractions for Hybrid Automata , 2002, HSCC.

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

[17]  Raffaella Gentilini.  Reachability Problems on Extended O-Minimal Hybrid Automata , 2005, FORMATS.

[18]  George E. Collins,et al.  Quantifier elimination for real closed fields by cylindrical algebraic decomposition , 1975 .

[19]  Daniel J. Miller.  Constructing o-minimal structures with decidable theories using generic families of functions from quasianalytic classes , 2010 .

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

[21]  Gerardo Lafferriere,et al.  A New Class of Decidable Hybrid Systems , 1999, HSCC.

[22]  A. Pillay,et al.  Definable sets in ordered structures , 1984 .

[23]  Anand Pillay,et al.  Discrete o-minimal structures , 1987, Ann. Pure Appl. Log..

[24]  Nicolai Vorobjov,et al.  Upper and Lower Bounds on Sizes of Finite Bisimulations of Pfaffian Hybrid Systems , 2006, CiE.

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

[26]  Lou van den Dries.  o-Minimal structures , 1996 .

[27]  Thomas Brihaye.  A note on the undecidability of the reachability problem for o-minimal dynamical systems , 2006, Math. Log. Q..

[28]  Thomas Brihaye,et al.  On the expressiveness and decidability of o-minimal hybrid systems , 2005, J. Complex..

[29]  A. Pillay,et al.  DEFINABLE SETS IN ORDERED STRUCTURES. II , 2010 .

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

[31]  Carla Piazza,et al.  Inclusion dynamics hybrid automata , 2008, Inf. Comput..

[32]  Wilfrid Hodges,et al.  A Shorter Model Theory , 1997 .

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

[34]  Carla Piazza,et al.  Decidable Compositions of O-Minimal Automata , 2008, ATVA.