Hybrid automata-based CEGAR for rectangular hybrid systems

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

Volumn 7737 LNCS, Issue , 2013, Pages 48-67

  Prabhakar, Pavithra ^a   Duggirala, Parasara Sridhar ^b   Mitra, Sayan ^b   Viswanathan, Mahesh ^b  

^a IMDEA SOFTWARE INSTITUTE   (Spain)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; HYBRID SYSTEMS; MODEL CHECKING;

ABSTRACT MODELS; ABSTRACTION-REFINEMENT; HYBRID AUTOMATONS;

AUTOMATA THEORY;

EID: 84881132663     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-35873-9_6     Document Type: Conference Paper

References (24)

1. HARE, https://wiki.cites.uiuc.edu/wiki/display/MitraResearch/HARE
2. Alur, R., Dang, T., Ivančić, F.: Counter-Example Guided Predicate Abstraction of Hybrid Systems. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol. 2619, pp. 208-223. Springer, Heidelberg (2003)
3. Asarin, E., Dang, T., Maler, O.: The d/dt tool for verification of hybrid system (2002)
4. Ball, T., Rajamani, S.: Bebop: A Symbolic Model Checker for Boolean Programs. In: Havelund, K., Penix, J., Visser, W. (eds.) SPIN 2000. LNCS, vol. 1885, pp. 113-130. Springer, Heidelberg (2000)
5. Clarke, E.M., Fehnker, A., Han, Z., Krogh, B., Ouaknine, J., Stursberg, O., Theobald, M.: Abstraction and Counterexample-Guided Refinement in Model Checking of Hybrid Systems. JFCS 14(4), 583-604 (2003)
6. Clarke, E.M., Fehnker, A., Han, Z., Krogh, B., Stursberg, O., Theobald, M.: Verification of Hybrid Systems Based on Counterexample-Guided Abstraction Refinement. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol. 2619, pp. 192-207. Springer, Heidelberg (2003)
7. Clarke, E.M., Grumberg, O., Jha, S., Lu, Y., Veith, H.: Counterexample-Guided Abstraction Refinement. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 154-169. Springer, Heidelberg (2000)
8. Corbett, J., Dwyer, M., Hatcliff, J., Laubach, S., Pasareanu, C., Robby, Zheng, H.: Bandera: Extracting finite-state models from Java source code. In: ICSE, pp. 439-448 (2000)
9. Dierks, H., Kupferschmid, S., Larsen, K.G.: Automatic Abstraction Refinement for Timed Automata. In: Raskin, J.-F., Thiagarajan, P.S. (eds.) FORMATS 2007. LNCS, vol. 4763, pp. 114-129. Springer, Heidelberg (2007)
10. Doyen, L., Henzinger, T.A., Raskin, J.-F.: Automatic Rectangular Refinement of Affine Hybrid Systems. In: Pettersson, P., Yi, W. (eds.) FORMATS 2005. LNCS, vol. 3829, pp. 144-161. Springer, Heidelberg (2005) (Pubitemid 43952393)
11. Fehnker, A., Clarke, E.M., Jha, S., Krogh, B.: Refining Abstractions of Hybrid Systems Using Counterexample Fragments. In: Morari, M., Thiele, L. (eds.) HSCC 2005. LNCS, vol. 3414, pp. 242-257. Springer, Heidelberg (2005) (Pubitemid 41252071)
12. Frehse, G., Le Guernic, C., Donzé, A., Cotton, S., Ray, R., Lebeltel, O., Ripado, R., Girard, A., Dang, T., Maler, O.: SpaceEx: Scalable Verification of Hybrid Systems. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol. 6806, pp. 379-395. Springer, Heidelberg (2011)
13. Frehse, G.: PHAVer: Algorithmic Verification of Hybrid Systems Past HyTech. In: Morari, M., Thiele, L. (eds.) HSCC 2005. LNCS, vol. 3414, pp. 258-273. Springer, Heidelberg (2005)
14. Henzinger, T.A., Jhala, R., Majumdar, R., Sutre, G.: Lazy Abstraction. In: POPL 2002, pp. 58-70 (2002)
15. Henzinger, T.A., Kopke, P.W., Puri, A., Varaiya, P.: What's decidable about hybrid automata? In: Proc. of STOC, pp. 373-382 (1995)
16. Henzinger, T.A.: The theory of hybrid automata. In: LICS, pp. 278-292 (1996)
17. Henzinger, T.A., Ho, P.-H.,Wong-Toi, H.: A Model Checker for Hybrid Systems. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol. 1254, pp. 460-483. Springer, Heidelberg (1997)
18. Henzinger, T.A., Ho, P.-H., Howard, W.-T.: Hytech: A Model Checker for Hybrid Systems. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol. 1254, pp. 460-483. Springer, Heidelberg (1997)
19. Holzmann, G., Smith, M.: Automating software feature verification. Bell Labs Technical Journal 5(2), 72-87 (2000)
20. Jha, S.K., Krogh, B.H., Weimer, J.E., Clarke, E.M.: Reachability for Linear Hybrid Automata Using Iterative Relaxation Abstraction. In: Bemporad, A., Bicchi, A., Buttazzo, G. (eds.) HSCC 2007. LNCS, vol. 4416, pp. 287-300. Springer, Heidelberg (2007)
21. Munoz, C.A., Dowek, G., Carreo, V.: Modeling and verification of an air traffic concept of operations. In: ISSTA, pp. 175-182 (2004)
22. Prabhakar, P., Duggirala, S., Mitra, S., Viswanathan, M.: Hybrid automata-based cegar for rectangular hybrid automata, http://software.imdea.org/ people/pavithra.prabhakar/Papers/vmcai2013tr.pdf
23. Segelken, M.: Abstraction and Counterexample-Guided Construction of ω-Automata for Model Checking of Step-Discrete Linear Hybrid Models. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol. 4590, pp. 433-448. Springer, Heidelberg (2007)
24. Sorea, M.: Lazy Approximation for Dense Real-Time Systems. In: Lakhnech, Y., Yovine, S. (eds.) FORMATS/FTRFTS 2004. LNCS, vol. 3253, pp. 363-378. Springer, Heidelberg (2004)