Efficient bounded reachability computation for rectangular automata

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

Volumn 6945 LNCS, Issue , 2011, Pages 139-152

  Chen, Xin ^a   Ábrahám, Erika ^a   Frehse, Goran ^b  

^a RWTH AACHEN UNIVERSITY   (Germany)

^b VERIMAG   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

COMPUTATION TIME; FLOW TRANSITIONS; LINEAR CONSTRAINTS; NEW APPROACHES; REACHABILITY; REACHABLE SET;

ARTIFICIAL INTELLIGENCE;

EID: 80053337288     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-24288-5_13     Document Type: Conference Paper

References (19)

1. Henzinger, T.A., Kopke, P.W., Puri, A., Varaiya, P.:What's decidable about hybrid automata? J. Comput. Syst. Sci. 57(1), 94-124 (1998)
2. Henzinger, T.A., Ho, P., Wong-Toi, H.: Algorithmic analysis of nonlinear hybrid systems. IEEE Transactions on Automatic Control 43(4), 540-554 (1998)
3. Preußig, J., Kowalewski, S., Wong-Toi, H., Henzinger, T.A.: An algorithm for the approximative analysis of rectangular automata. In: Ravn, A.P., Rischel, H. (eds.) FTRTFT 1998. LNCS, vol. 1486, pp. 228-240. Springer, Heidelberg (1998)
4. Wong-Toi, H., Preußig, J.: A procedure for reachability analysis of rectangular automata. In: Proc. of American Control Conference, vol. 3, pp. 1674-1678 (2000)
5. Doyen, L., Henzinger, T.A., Raskin, J.: Automatic rectangular refinement of affine hybrid systems. In: Pettersson, P., Yi,W. (eds.) FORMATS 2005. LNCS, vol. 3829, pp. 144-161. Springer, Heidelberg (2005)
6. Alur, R., Dill, D.L.: A theory of timed automata. Theor. Comput. Sci. 126(2), 183-235 (1994)
7. Chutinan, A., Krogh, B.H.: Computing polyhedral approximations to flow pipes for dynamic systems. In: Proc. of CDC 1998. IEEE Press, Los Alamitos (1998)
8. Stursberg, O., Krogh, B.H.: Efficient representation and computation of reachable sets for hybrid systems. In: Maler, O., Pnueli, A. (eds.) HSCC 2003. LNCS, vol. 2623, pp. 482-497. Springer, Heidelberg (2003)
9. Girard, A.: Reachability of uncertain linear systems using zonotopes. In: Morari, M., Thiele, L. (eds.) HSCC 2005. LNCS, vol. 3414, pp. 291-305. Springer, Heidelberg (2005)
10. Henzinger, T.A., Ho, P.-H., Wong-Toi, H.: Hytech: A model checker for hybrid systems. Software Tools for Technology Transfer (1), 110-122 (1997)
11. 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)
12. Ziegler, G.M.: Lectures on Polytopes. Graduate Texts in Mathematics, vol. 152. Springer, Heidelberg (1995)
13. Chen, X., Abraham, E., Frehse, G.: Efficient bounded reachability computation for rectangular automata. Technical report, RWTH Aachen University (2011), http://www-i2.informatik.rwth-aachen.de/i2/hybrid-research-pub0/
14. Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)
15. Fukuda, K.: From the zonotope construction to the minkowski addition of convex polytopes. J. Symb. Comput. 38(4), 1261-1272 (2004)
16. Weibel, C., Fukuda, K.: Computing faces up to k dimensions of a minkowski sum of polytopes. In: Proc. of CCCG 2005, pp. 256-259 (2005)
17. Henzinger, T.A.: The theory of hybrid automata. In: Proc. of LICS 1996, pp. 278-292 (1996)
18. Fukuda, K.: cdd, cddplus and cddlib homepage, http://www.ifor.math.ethz. ch/~fukuda/cdd-home/
19. Frehse, G., Le Guernic, C., Donzé, A., 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)