Reachability for linear hybrid automata using iterative relaxation abstraction

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

Volumn 4416 LNCS, Issue , 2007, Pages 287-300

  Jha, Sumit K ^a   Krogh, Bruce H ^b   Weimer, James E ^b   Clarke, Edmund M ^a  

^a Carnegie Mellon University   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; HYBRID COMPUTERS; ITERATIVE METHODS; LINEAR PROGRAMMING; SCALABILITY;

DISCRETE SYSTEMS; ITERATIVE RELAXATION ABSTRACTION (IRA); LINEAR HYBRID AUTOMATA;

LINEAR CONTROL SYSTEMS;

EID: 38049133050     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-71493-4_24     Document Type: Conference Paper

References (26)

1. Henzinger, T.: The Theory of Hybrid Automata. Lecture Notes in Computer Science (1996) 278
2. Alur, R., Courcoubetis, C., Halbwachs, N., Henzinger, T.A., Ho, P.H., Nicollin, X., Olivero, A., Sifakis, J., Yovine, S.: The algorithmic analysis of hybrid systems. Theoretical Computer Science 138(1) (1995) 3-34
3. Henzinger, T.A., Ho, P.H., Wong-Toi, H.: HyTech: A model checker for hybrid systems. International Journal on Software Tools for Technology Transfer 1(1-2) (1997) 110-122
4. Alur, R., Henzinger, T., Wong-Toi, H.: Symbolic analysis of hybrid systems. In: Proc. 37-th IEEE Conference on Decision and Control. (1997)
5. Frehse, G.: PHAVer: Algorithmic Verification of Hybrid Systems Past HyTech. [26] 258-273
6. Kurshan, R.: Computer-aided Verification of Coordinating Processes: The Automata Theoretic Approach. Princeton University Press, 1994. (1994)
7. Clarke, E.M., Grumberg, O., Jha, S., Lu, Y., Veith, H.: Counterexample-guided abstraction refinement. In: CAV '00: Proceedings of the 12th International Conference on Computer Aided Verification, London, UK, Springer-Verlag (2000) 154-169
8. Ball, T., Majumdar, R., Millstein, T.D., Rajamani, S.K.: Automatic Predicate Abstraction of C Programs. In: SIGPLAN Conference on Programming Language Design and Implementation. (2001) 203-213
9. E. M. Clarke, J., Grumberg, O., Peled, D.A.: Model Checking. MIT Press, Cambridge, MA, USA (1999)
10. Zhang, L., Malik, S.: Validating SAT Solvers Using an Independent ResolutionBased Checker: Practical Implementations and Other Applications. In: DATE, IEEE Computer Society (2003) 10880-10885
11. Chaki, S., Clarke, E., Groce, A., Strichman, O.: Predicate abstraction with minimum predicates. In: Proceedings of 12th Advanced Research Working Conference on Correct Hardware Design and Verification Methods (CHARME). (2003)
12. Li, X., Jha, S.K., Bu, L.: Towards an Efficient Path-Oriented Tool for Bounded Reachability analysis of Linear Hybrid Systems using Linear Programming. (2006)
13. Chinneck, J., Dravnieks, E.: Locating minimal infeasible constraint sets in linear programs. ORSA Journal on Computing 3 (1991) 157-168
14. Dantzig, G.B., Eaves, B.C.: Fourier-Motzkin elimination and Its Dual. J. Comb. Theory, Ser. A 14(3) (1973) 288-297
15. Sankaran, J.K,: A note on resolving infeasibility in linear programs by constraint relaxation, Operations Research Letters 13 (1993) 1920
16. Chinneck, J.W.: MINOS(IIS): Infeasibility analysis using MINOS. Comput. Oper. Res. 21(1) (1994) 1-9
17. ILOG: (http://www.ilog.com/products/cplex/product/simplex.cfm)
18. Hung, M.S., Rom, W.O., Waren, A.D.: Optimization with IBM OSL and Handbook for IBM OSL (1993)
19. Systems Inc., L.: (http://www.lindo.com/products/api/dllm.html)
20. Ho, P.H.: Automatic Analysis of Hybrid Systems, Ph.D. thesis, technical report CSD-TR95-1536, Cornell University, August 1995, 188 pages (1995)
21. Mohri, M., Pereira, F., Riley, M.: The design principles of a weighted finite-state transducer library, Theoretical Computer Science 231(1) (2000) 17-32
22. Jiang, S.: Reachability analysis of Linear Hybrid Automata by using counterexample fragment based abstraction refinement, submitted (2006)
23. Karmarkar, N.: A new polynomial-time algorithm for linear programming. Combinatorica 4(4) (1984) 373-395
24. Fehnker, A., Clarke, E.M., Jha, S.K., Krogh, B.H.: Refining Abstractions of Hybrid Systems Using Counterexample Fragments. [26] 242-257
25. Alur, R., Dang, T., Ivanèic, F.: Counterexample-guided predicate abstraction of hybrid systems. Theor. Comput. Sci. 354(2) (2006) 250-271
26. Morari, M., Thiele, L., eds.: Hybrid Systems: Computation and Control, 8th International Workshop, HSCC 2005, Zurich, Switzerland, March 9-11, 2005, Proceedings. In Morari, M., Thiele, L., eds.: HSCC Volume 3414 of Lecture Notes in Computer Science., Springer (2005)