Abstraction and counterexample-guided refinement in model checking of hybrid systems

International Journal of Foundations of Computer Science

Volumn 14, Issue 4, 2003, Pages 583-604

  Clarke, Edmund ^a   Fehnker, Ansgar ^b   Han, Zhi ^b   Krogh, Bruce ^b   Ouaknine, Joël ^a   Stursberg, Olaf ^b,c   Theobald, Michael ^a  

^a Carnegie Mellon University   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

^c TU DORTMUND UNIVERSITY   (Germany)

Author keywords

Abstraction; hybrid systems; infinite state systems; model checking; refinement; verification

Indexed keywords

EID: 3042559983     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S012905410300190X     Document Type: Article

References (30)

1. R. Alur, T. Dang, and F. Ivancic. Reachability analysis of hybrid systems via predicate abstraction.In HSCC, volume 2289 of LNCS, pages 35-48. Springer, 2002
2. R. Alur, T. Dang, and F. Ivancic. Counter-example guided predicate abstraction of hybridsystem. In TACAS, volume 2619 of LNCS. Springer, 2003
3. R. Alur, T.A. Henzinger, G. Lafferriere, and GJ. Pappas. Discrete abstractions of hybridsystems. Proceedings of the IEEE, 88(7):971-984, 2000
4. E. Asarin, T. Dang, O. Maler, and O. Bournez. Approximate reachability analysis ofpiecewise-linear dynamical systems. In HSCC, volume 1790 of LNCS. Springer, 2000
5. T. Ball, R. Majumdar, T.D. Millstein, and S.K. Rajamani. Automatic predicate abstraction ofC programs. In PLDI, SIGPLAN 36(5), 2001
6. A. Chutinan and B.H. Krogh. Verification of polyhedral-invariant hybrid automata usingpolygonal flow pipe approximations. In HSCC, volume 1569 of LNCS, pages 76-90. Springer,1999
7. A. Chutinan and B.H. Krogh. Verification of infinite-state dynamic systems using approximatequotient transition systems. IEEE Transactions on Automatic Control, 46(9): 1401-1410,2001
8. E.M. Clarke and E.A. Emerson. Design and synthesis of synchronization skeletons usingbranching-time temporal logic. In Logic of Programs, volume 131 of LNCS. Springer, 1981
9. E.M. Clarke, E.A. Emerson, and A. Prasad Sistla. Automatic verification of finite state concurrent systems using temporal logic specifications: A practical approach. In POPL, 1983
10. E.M. Clarke, A. Fehnker, Z. Han, B. Krogh, O. Stursberg, and M. Theobald. Verification ofhybrid systems based on counterexample-guided abstraction refinement. In TACAS, volume2619 of LAO. Springer, 2003
11. E.M. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith. Counterexample-guided abstractionrefinement. In CAV, volume 1855 of LNCS, pages 154-169. Springer, 2000
12. E.M. Clarke, O. Grumberg, and D.A. Peled. Model Checking. MIT Press, 1999
13. E.M. Clarke, A. Gupta, J. Kukula, and O. Strichman. SAT based abstraction-refinement usingILP and machine learning techniques. In CAV, volume 2404 of LNCS. Springer, 2002
14. T. Dang and O. Maler. Reachability analysis via face lifting. In HSCC, volume 1386 of LNCS,pages 96-109. Springer, April 1998
15. G. Frehse, O. Stursberg, S. Engell, R. Huuck, and B. Lukoschus. Modular analysis of discretecontrollers for distributed hybrid systems. In IFAC World Congress, 2002
16. A.R. Girard, J.B. de Souza, J.A. Misener, and J.K. Hedrick. A control architecture for integratedcooperative cruise control and collision warning systems. In Proceedings of the Controland Decision Conference, pages 1-1, Florida, December 2001
17. M.R. Greenstreet and I. Mitchell. Reachability analysis using polygonal projections. InHSCC, volume 1569 of LNCS, pages 103-116. Springer, 1999
18. T.A. Henzinger. The theory of hybrid automata. In Symp. on Logic in Computer Science,pages 278-292. IEEE Computer Society Press, 1996
19. T.A. Henzinger, R. Jhala, R. Majumdar, and G. Sutre. Lazy abstraction. In Symp. onPrinciples of Programming Languages, pages 58-70. ACM Press, 2002
20. T.A. Henzinger, P.W. Kopke, A. Puri, and P. Varaiya. What's decidable about hybrid automata?In Symposium on Theory of Computing, pages 373-382. ACM Press, 1995
21. T.A. Henzinger, M. Minea, and V. Prabhu. Assume-guarantee reasoning for hierarchicalhybrid systems. In HSCC, volume 2034 of LNCS, pages 275-290. Springer, 2001
22. T.A. Henzinger, J. Preussig, and H. Wong-Toi. Some lessons from the HyTech experience. InProceedings of the 40th Annual Conference on Decision and Control. IEEE Press, 2001
23. D.R. Hofstadter. Godel, Escher, Bach: An Eternal Golden Braid. Basic Books, 1989
24. B. Jeannet, N. Halbwachs, and P. Raymond. Dynamic partitioning in analyses of numericalproperties. In Static Analysis Symposium, volume 1694 of LNCS. Springer, 1999
25. R. Kurshan. Computer-Aided Verification of Coordinating Processes: The Automata-Theoretic Approach. Princeton University Press, 1994
26. A. Kurzhanski and P. Varaiya. Ellipsoidal techniques for reachability analysis. In HSCC,volume 1790 of LNCS, pages 203-213. Springer, 2000
27. G. Lafferriere, G.J.. Pappas, and S. Yovine. A new class of decidable hybrid systems. InHSCC, volume 1569 of LNCS, pages 103-116. Springer, 1999
28. MoBIES. DARPA project, http://vehicle.me.berkeley.edu/mobies/vehicle
29. B.I. Silva, O. Stursberg, B. Krogh, and S. Engell. An assessment of the current status ofalgorithmic approaches to the verification of hybrid systems. In IEEE Conf on Decision andControl, pages 2867-2874, 2001
30. A. Tiwari and G. Khanna. Series of abstractions for hybrid automata. In HSCC, volume 2289of LNCS, pages 465-478. Springer, 2002.