Approximate Equivalence of the Hybrid Automata with Taylor Theory

Hybrid automaton is a formal model for precisely describing a hybrid system in which the computational processes interact with the physical ones. The reachability analysis of the polynomial hybrid automaton is decidable, which makes the Taylor approximation of a hybrid automaton applicable and valuable. In this paper, we studied the simulation relation among the hybrid automaton and its Taylor approximation, as well as the approximate equivalence relation. We also proved that the Taylor approximation simulates its original hybrid automaton, and similar hybrid automata could be compared quantitatively, for example, the approximate equivalence we proposed in the paper.

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

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

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

[4]  Martin Fränzle,et al.  Analysis of Hybrid Systems: An Ounce of Realism Can Save an Infinity of States , 1999, CSL.

[5]  Abbas Edalat,et al.  Denotational semantics of hybrid automata , 2007, J. Log. Algebraic Methods Program..

[6]  Melvin Michael Henry,et al.  Model-based Estimation of Probabilistic Hybrid Automata , 2002 .

[7]  Bruce H. Krogh,et al.  Verification of Polyhedral-Invariant Hybrid Automata Using Polygonal Flow Pipe Approximations , 1999, HSCC.

[8]  T. Henzinger,et al.  Algorithmic Analysis of Nonlinear Hybrid Systems , 1998, CAV.

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

[10]  Thomas A. Henzinger,et al.  Symbolic Model Checking for Rectangular Hybrid Systems , 2000, TACAS.

[11]  Alexandre M. Bayen,et al.  Guaranteed Overapproximations of Unsafe Sets for Continuous and Hybrid Systems: Solving the Hamilton-Jacobi Equation Using Viability Techniques , 2002, HSCC.

[12]  Klaus Schneider,et al.  Successive Abstractions of Hybrid Automata for Monotonic CTL Model Checking , 2007, LFCS.

[13]  Simone Tini,et al.  Taylor approximation for hybrid systems , 2005, Inf. Comput..

[14]  Pravin Varaiya,et al.  On Reachability Under Uncertainty , 2002, SIAM J. Control. Optim..

[15]  Martin Fränzle,et al.  What Will Be Eventually True of Polynomial Hybrid Automata? , 2001, TACS.

[16]  Richard M. Murray,et al.  Probabilistic Safety Analysis of Sensor-Driven Hybrid Automata , 2009 .

[17]  Andreas Podelski,et al.  Model Checking of Hybrid Systems: From Reachability Towards Stability , 2006, HSCC.