Counter-example guided predicate abstraction of hybrid systems

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

Volumn 2619, Issue , 2003, Pages 208-223

  Alur, Rajeev ^a   Dang, Thao ^b   Ivančić, Franjo ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b VERIMAG   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; HYBRID SYSTEMS;

COMPUTATION TECHNIQUES; COUNTER EXAMPLES; FINITE-STATE MODELS; INFINITE STATE SYSTEMS; LINEAR DYNAMICS; PREDICATE ABSTRACTIONS; TRUTH ASSIGNMENT; VERIFICATION TOOLS;

ABSTRACTING;

EID: 35248881052     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Article

References (23)

1. R. Alur, C. Courcoubetis, N. Halbwachs, T.A. Henzinger, P. Ho, X. Nicollin, A. Olivero, J. Sifakis, and S. Yovine. The algorithmic analysis of hybrid systems. Theoretical Computer Science, 138:3-34, 1995.
2. R. Alur, T. Dang, J. Esposito, Y. Hur, F. Ivančić, V. Kumar, I. Lee, P. Mishra, G. Pappas, and O. Sokolsky. Hierarchical modeling and analysis of embedded systems. Proceedings of the IEEE, 91(1), January 2003.
3. R. Alur, T. Dang, and F. Ivančić. Reachability analysis of hybrid systems via predicate abstraction. In Hybrid Systems: Computation and Control, Fifth International Workshop, LNCS 2289. Springer-Verlag, 2002.
4. R. Alur and D.L. Dill. A theory of timed automata. Theoretical Computer Science, 126:183-235, 1994.
5. R. Alur, A. Itai, R.P. Kurshan, and M. Yannakakis. Timing verification by successive approximation. Information and Computation, 118(1):142-157, 1995.
6. E. Asarin, O. Bournez, T. Dang, and O. Maler. Approximate reachability analysis of piecewise-linear dynamical systems. In Hybrid Systems: Computation and Control, Third International Workshop, LNCS 1790, pages 21-31. 2000.
7. T. Ball and S. Rajamani. Bebop: A symbolic model checker for boolean programs. In SPIN 2000 Workshop on Model Checking of Software, LNCS 1885. 2000.
8. S. Cameron. A comparison of two fast algorithms for computing the distance between convex polyhedra. IEEE Transactions on Robotics and Automation, 13(6):915-920, 1997.
9. A. Chutinan and B.K. Krogh. Verification of polyhedral-invariant hybrid automata using polygonal flow pipe approximations. In Hybrid Systems: Computation and Control, Second International Workshop, LNCS 1569, pages 76-90. 1999.
10. E. Clarke, A. Fehnker, Z. Han, B. Krogh, O. Stursberg, and M. Theobald. Verification of hybrid systems based on counterexample-guided abstraction refinement. In Tools and Algorithms for the Construction and Analysis of Systems, 2003.
11. E. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith. Counterexample-guided abstraction refinement. In Computer Aided Verification, pages 154-169, 2000.
12. E.M. Clarke and R.P. Kurshan. Computer-aided verification. IEEE Spectrum, 33(6):61-67, 1996.
13. J.C. Corbett, M.B. Dwyer, J. Hatcliff, S. Laubach, C.S. Pasareanu, Hobby, and H. Zheng. Bandera: Extracting finite-state models from Java source code. In Proceedings of 22nd International Conference on Software Engineering. 2000.
14. P. Cousot and R. Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proceedings of the 4th ACM Symposium on Principles of Programming Languages, 1977.
15. G. Das and D. Joseph. The complexity of minimum convex nested polyhedra. In Canadian Conference on Computational Geometry, 1990.
16. C. Daws, A. Olivero, S. Tripakis, and S. Yovine. The tool KRONOS. In Hybrid Systems III: Verification and Control, LNCS 1066. Springer-Verlag, 1996.
17. D. Dobkin and D. Kirkpatrick. Determining the separation of preprocessed polyhedra - a unified approach. In Proc. of ICALP'90, pages 400-413, 1990.
18. H. Edelsbrunner and F.P. Preparata. Minimum polygon separation. Information and Computation, 77:218-232, 1987.
19. T.A. Henzinger, P. Ho, and H. Wong-Toi. HYTECH: the next generation. In Proceedings of the 16th IEEE Real-Time Systems Symposium, pages 56-65, 1995.
20. G.J. Holzmann. The model checker SPIN. IEEE Transactions on Software Engineering, 23(5):279-295, 1997.
21. G.J. Holzmann and M.H. Smith. Automating software feature verification. Bell Labs Technical Journal, 5(2):72-87, 2000.
22. K. Larsen, P. Pettersson, and W. Yi. UPPAAL in a nutshell. Springer International Journal of Software Tools for Technology Transfer, 1, 1997.
23. C. Loiseaux, S. Graf, J. Sifakis, A. Bouajjani, and S. Bensalem. Property preserving abstractions for the verification of concurrent systems. Formal Methods in System Design Volume 6, Issue 1, 1995.