Predicate Abstraction for Reachability Analysis of Hybrid Systems

ACM Transactions on Embedded Computing Systems

Volumn 5, Issue 1, 2006, Pages 152-199

  Alur, Rajeev ^a   Dang, Thao ^b   Verimag, ^b  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b NEC LABORATORIES AMERICA   (United States)

Author keywords

Algorithms; hybrid systems; predicate abstraction; Reachability analysis; Reliability; Verification

Indexed keywords

EID: 34948903134     PISSN: 15399087     EISSN: 15583465     Source Type: Journal    
DOI: 10.1145/1132357.1132363     Document Type: Article

References (58)

1. Alur, R. and Dill, D. 1994. A theory of timed automata. Theoretical Computer Science 126, 183-235
2. Alur, R., Courcoubetis, C., Halbwachs, N., Henzinger, T., Ho, P., Nicollin, X., Olivero, A., Sifakis, J., and Yovine, S. 1995a. The algorithmic analysis of hybrid systems. Theoretical Computer Science 138, 3-34
3. Alur, R., Itai, A., Kurshan, R., and Yannakakis, M. 1995b. Timing verification by successive approximation. Information and Computation 118, 1, 142-157
4. Alur, R., Henzinger, T., and Ho, P.-H. 1996. Automatic symbolic verification of embedded systems. IEEE Transactions on Software Engineering 22, 3, 181-201
5. Alur, R., Grosu, R., Hur, Y., Kumar, V., and Lee, I. 2000a. Modular specifications of hybrid systems in CHARON. In Hybrid Systems: Computation and Control, Third International Workshop. Vol. LNCS 1790. 6-19
6. Alur, R., Henzinger, T., Lafferriere, G., and Pappas, G. 2000b. Discrete abstractions of hybrid systems. Proceedings of the IEEE
7. Alur, R., Dang, T., and Ivancc, F. 2002. Reachability analysis of hybrid systems via predicate abstraction. In Hybrid Systems: Computation and Control, Fifth International Workshop, C. Tomlin and M. Greenstreet, Eds. LNCS 2289. Springer-Verlag, New York, 35-48
8. Alur, R., Dang, T., and Ivancc, F. 2003a. Counter-example guided predicate abstraction of hybrid systems. In Ninth International Conference on Tools and Algorithms for the Construction and Analysis of Systems
9. Alur, R., Dang, T., and Ivancic, F. 2003b. Progress on reachability analysis of hybrid systems via predicate abstraction. In Hybrid Systems: Computation and Control, Sixth International Workshop
10. Alur, R., Dang, T., Esposito, J., Hur, Y., Ivancic, F., Kumar, V., Lee, I., Mishra, P., Pappas, G., and Sokolsky, O. 2003c. Hierarchical modeling and analysis of embedded systems. Proceedings of the IEEE 91, 1 (Jan.)
11. Asarin, E., Bournez, O., Dang, T., and Maler, O. 2000. Approximate reachability analysis of piecewise-linear dynamical systems. In Hybrid Systems: Computation and Control, Third International Workshop. LNCS 1790. Springer Verlag, New York. 21-31
12. Ball, T. and Rajamani, S. 2000. Bebop: A symbolic model checker for boolean programs. In SPIN 2000 Workshop on Model Checking of Software. LNCS 1885. Springer, New York. 113-130
13. Barber, C., Dobkin, D., and Huhdanpaa, H. 1996. The Quickhull algorithm for convex hulls. ACM Transactions on Mathematical Software 22, 4 (Dec.), 469-483
14. Behrmann, G., Larsen, K., Pearson, J., Weise, C., and Yi, W. 1999. Efficient timed reachability analysis using clock difference diagrams. In Computer Aided Verification, 11th International Conference. LNCS, vol. 1633. Springer-Verlag, New York
15. Bengsston, J., Larsen, K., Larsson, F., Pettersson, P., Yi, W., and Weise, C. 1998. New generation of UPPAAL. In Proceedings of International Workshop on Software Tools for Technology Transfer
16. Bensalem, S., Ganesh, V., Lakhnech, Y., Noz, C. M., Owre, S., Ruess, H., Rushby, J., Rusu, V., Saidi, H., Shankar, N., Singerman, E., and Tiwari, A. 2000. An overview of SAL. In LFM2000: Fifth NASA Langley Formal Methods Workshop, C. M. Holloway, Ed. Hampton, VA. 187-196
17. Chutinan, A. and Krogh, B. 1999. Verification of polyhedral-invariant hybrid automata using polygonal flow pipe approximations. In Hybrid Systems: Computation and Control, Second International Workshop. LNCS 1569. Springer-Verlag, New York. 76-90
18. Chutinan, A. and Krogh, B. 2000. Approximate quotient transition systems for hybrid systems. In Proceedings of the 2000 American Control Conference
19. Clarke, E., Grumberg, O., and Long, D. 1993. Verification tools for finite-state concurrent systems. In Decade of Concurrency-Reflections and Perspectives (Proceedings of REX School). LNCS 803. Springer-Verlag, New York. 124-175
20. Clarke, E., Grumberg, O., Jha, S., Lu, Y., and Veith, H. 2000. Counterexample-guided abstraction refinement. In Computer Aided Verification. 154-169
21. Clarke, E., Biere, A., Raimi, R., and Zhu, Y. 2001. Bounded model checking using satisfiability solving. Formal Methods in Systems Design 19, 1, 7-34
22. Clarke, E., Fehnker, A., Han, Z., Krogh, B., Ouaknine, J., Stursberg, O., and Theobald, M. 2003a. Abstraction and counterexample-guided refinement of hybrid systems. Intern. Journal of Foundations of Computer Science 14, 4 (Aug.), 583-604
23. Clarke, E., Fehnker, A., Han, Z., Krogh, B., Stursberg, O., and Theobald, M. 2003b. Verification of hybrid systems based on counterexample-guided abstraction refinement. In Ninth International Conference on Tools and Algorithms for the Construction and Analysis of Systems
24. Clarke, E. and Kurshan, R. 1996. Computer-aided verification. IEEE Spectrum 33, 6, 61-67
25. Computer Science and Telecommunications Board. 2001. Embedded, Everywhere: A Research Agenda for Networked Systems of Embedded Computers
26. Corbett, J., Dwyer, M., Hatcliff, J., Laubach, S., Pasareanu, C., Robby, and Zheng, H. 2000. Bandera: Extracting finite-state models from Java source code. In Proceedings of 22nd International Conference on Software Engineering. 439-448
27. Cousot, P. and Cousot, R. 1977. 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. 238-252
28. Cury, J., Krogh, B., and Niinomi, T. 1998. Synthesis of supervisory controller for hybrid systems based on approximating automata. IEEE Transaction on Automatic Control 43, 4 (Apr.), 564-569
29. Dang, T. 2000. Verification and synthesis of hybrid systems. Ph.D. thesis, Institut National Poly-tecnique de Grenoble
30. Dang, T. and Maler, O. 1998. Reachability analysis via face-lifting. In Hybrid Systems: Computation and Control. LNCS, vol. 1386. Springer-Verlag, New York. 96-109
31. Das, S., Dill, D., and Park, S. 1999. Experience with predicate abstraction. In Computer Aided Verification, 11th International Conference. LNCS 1633. Springer, New York. 160-171
32. Daws, C., Olivero, A., Tripakis, S., and Yovine, S. 1996. The tool KRONOS. In Hybrid Systems III: Verification and Control. LNCS 1066. Springer-Verlag, New York. 208-219
33. De Moura, L., Owre, S., Rueß, H., Rushby, J., Shankar, N., Sorea, M., and Tiwari, A. 2004. SAL 2. In Computer-Aided Verification, CAV2004, R. Alur and D. Peled, Eds. Lecture Notes in Computer Science, vol. 3114. Springer-Verlag, New York, 496-500
34. Fehnker, A. and Ivancic, F. 2004. Benchmarks for hybrid systems verification. In Hybrid Systems: Computation and Control, R. Alur and G. Pappas, Eds. Lecture Notes in Computer Science, vol. 2993. Springer, New York. 326-341
35. Fehnker, A., Clarke, E., Jha, S., and Krogh, B. 2005. Refining abstractions of hybrid systems using counterexample fragments. In Hybrid Systems:Computation and Control (HSCC). LNCS. Springer
36. Fukuda, K. 2001. cddlib reference manual, cddlib version 092a. Tech. rep., McGill University
37. Girard, A. 2002. Hybrid system architectures for coordinated vehicle control. Ph.D. thesis, University of California at Berkeley, Berkeley, CA
38. Godbole, D. and Lygeros, J. 1994. Longitudinal control of a lead card of a platoon. IEEE Transactions on Vehicular Technology 43, 4, 1125-1135
39. Godefroid, P., Huth, M., and Jagadeesan, R. 2001. Abstraction-based model checking using modal transition systems. In 12th International Conference on Concurrency Theory. Lecture Notes in Computer Science, vol. 2154. 426-440
40. Graf, S. and Saidi, H. 1997. Construction of abstract state graphs with PVS. In Proceedings of the 9th International Conference on Computer Aided Verification (CAV'97), vol. 1254. Springer Verlag, New York. 72-83
41. Greenstreet, M. and Mitchell, I. 1999. Reachability analysis using polygonal projections. In Hybrid Systems: Computation and Control, Second International Workshop. LNCS 1569. SpringerVerlag, New York. 103-116
42. Halbwachs, N., Proy, Y., and Raymond, P. 1994. Verification of linear hybrid systems by means of convex approximations. In International Symposium on Static Analysis. LNCS 864. SpringerVerlag, New York
43. Henzinger, T., Ho, P., and Wong-Toi, H. 1995. HYTECH: the next generation. In Proceedings of the 16th IEEE Real-Time Systems Symposium. 56-65
44. Henzinger, T., Ho, P., and Wong-Toi, H. 1997. HYTECH: a model checker for hybrid systems. Software Tools for Technology Transfer
45. Henzinger, T., Jhala, R., Majumdar, R., and Sutre, G. 2002. Lazy abstraction. In Symposium on Principles of Programming Languages. 58-70
46. Henzinger, T., Jhala, R., Majumdar, R., and Mcmillan, K. 2004. Abstractions from proofs. In Symposium on Principles of Programming Languages. ACM Press, New York. 232-244
47. Holzmann, G. 1997. The model checker SPIN. IEEE Trans. Software Engineering 23, 5, 279-295
48. Holzmann, G. and Smith, M. 2000. Automating software feature verification. Bell Labs Technical J. 5, 2, 72-87
49. Ivancic, F. 2002. Report on verification of the MoBIES vehicle-vehicle automotive OEP problem. Tech. Rep. MS-CIS-02-02 (March). University of Pennsylvania, Philadelphia, PA
50. Jain, H., Ivanccic, F., Gupta, A., and Ganai, M. 2005. Localization and register sharing for predicate abstraction. In 11th International Conference on Tools and Algorithms for the Construction and Analysis of Systems. LNCS, vol. 3340. Springer, New York, 397-412
51. Kurzhanski, A. and Varaiya, P. 2000. Ellipsoidal techniques for reachability analysis. In Hybrid Systems: Computation and Control, Third International Workshop. LNCS 1790. Springer-Verlag, New York. 202-214
52. Loiseaux, C., Graf, S., Sifakis, J., Bouajjani, A., and Bensalem, S. 1995. Property preserving abstractions for the verification of concurrent systems. Formal Methods in System Design 6, 1
53. Mitchell, I. Andtomlin, C. 2000. Level set methods for computation in hybrid systems. In Hybrid Systems: Computation and Control, Third International Workshop. LNCS 1790. Springer-Verlag, New York. 310-323
54. Mioller, M. O., Rueß, H., and Sorea, M. 2002. Predicate abstraction for dense real-time systems
55. Puri, A. and Varaiya, P. 1995. Driving safely in smart cars. Tech. Rep. UBC-ITS-PRR-95-24,
56. Silva, B., Stursberg, O., Krogh, B., and Engell, S. 2001. An assessment of the current status of algorithmic approaches to the verification of hybrid systems. In 40th Conference on Decision and Control
57. Sorea, M. 2002. Bounded model checking for timed automata. Electronic Notes in Theoretical Computer Science 68, 5
58. Tiwari, A. and Khanna, G. 2002. Series of abstractions for hybrid automata. In Hybrid Systems: Computation and Control, Fifth International Workshop, C. Tomlin and M. Greenstreet, Eds. LNCS 2289. Springer-Verlag, New York. 465-478