Automatic rectangular refinement of affine hybrid systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3829 LNCS, Issue , 2005, Pages 144-161

  Doyen, Laurent ^a   Henzinger, Thomas A ^b,c   Raskin, Jean François ^a  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^b EPFL   (Switzerland)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; AUTOMATA THEORY; AUTOMATIC PROGRAMMING; BENCHMARKING; LINEAR EQUATIONS;

AFFINE HYBRID SYSTEMS; HYBRID AUTOMATON; LINEAR DIFFERENTIAL EQUATIONS; RECTANGULAR REFINEMENT;

DIFFERENTIAL EQUATIONS;

EID: 33745464615     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11603009_13     Document Type: Conference Paper

References (12)

1. R. Alur, C. Courcoubetis, N. Halbwachs, T.A. Henzinger, P.-H. Ho, X. Nicollin, A. Olivero, J. Sifakis, and S. Yovine. The algorithmic analysis of hybrid systems. Theoretical Computer Science, 138:3-34, 1995.
2. Eugene Asarin, Thao Dang, Oded Maler, and Olivier Bournez. Approximate reachability analysis of piecewise-linear dynamical systems. In Proceedings of HSCC 2000: Hybrid Systems, Computation and Control, LNCS 1790, pages 20-31. Springer, 2000.
3. R. Bagnara, E. Ricci, E. Zaffanella, and P. M. Hill. Possibly not closed convex polyhedra and the Parma Polyhedra Library. In Static Analysis: Proceedings of the 9th International Symposium, LNCS 2477, pages 213-229, Springer, 2002.
4. Edmund M. Clarke, Orna Grumberg, Somesh Jha, Yuan Lu, and Helmut Veith. Counterexample-guided abstraction refinement. In Proceedings of CAV 2000: Computer Aided Verification, LNCS 1855, pages 154-169. Springer, 2000.
5. Ansgar Fehnker and Franjo Ivancic. Benchmarks for hybrid systems verification. In HSCC 04: Hybrid Systems, Computation and Control, LNCS 2993, pages 326-341. Springer, 2004.
6. Martin Fränzle. Analysis of hybrid systems: An ounce of realism can save an infinity of states. In Proceedings of CSL 1999: Computer Science Logic, LNCS 1683, pages 126-140. Springer, 1999.
7. Goran Frehse. Phaver: Algorithmic verification of hybrid systems past HYTECH. In HSCC 05: Hybrid Systems, Computation and Control, LNCS 3414, pages 258-273. Springer, 2005.
8. T.A. Henzinger. The theory of hybrid automata. In Proceedings of the 11th Annual Symposium on Logic in Computer Science, pages 278-292. IEEE Computer Society Press, 1996.
9. T.A. Henzinger, P.-H. Ho, and H. Wong-Toi. A user guide to HYTECH. In TACAS 95: Tools and Algorithms for the Construction and Analysis of Systems, LNCS 1019, pages 41-71. Springer, 1995.
10. T.A. Henzinger, P.-H. Ho, and H. Wong-Toi. Algorithmic analysis of nonlinear hybrid systems. IEEE Transactions on Automatic Control, 43:540-554, 1998.
11. T.A. Henzinger, P.W. Kopke, A. Puri, and P. Varaiya. What's decidable about hybrid automata? Journal of Computer and System Sciences, 57:94-124, 1998.
12. R. Milner. A Calculus of Communicating Systems. LNCS 92. Springer, 1980.