D-IRA: A distributed reachability algorithm for analysis of linear hybrid automata

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

Volumn 4981 LNCS, Issue , 2008, Pages 618-621

  Jha, Sumit Kumar ^a  

^a Carnegie Mellon University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; HYBRID SYSTEMS; LINEAR PROGRAMMING; ROBOTS;

COMPUTATIONAL NODES; ITERATIVE RELAXATIONS; LINEAR HYBRID AUTOMATA; REACHABILITY; REACHABILITY PROBLEM;

ITERATIVE METHODS;

EID: 70350038257     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-78929-1_48     Document Type: Conference Paper

References (6)

1. Clarke, J.E.M., Grumberg, O., Peled, D.A.:Model Checking.MIT Press, Cambridge, MA, USA (1999)
2. 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)
3. Ho, P.-H.: Automatic Analysis of Hybrid Systems, Ph.D. thesis, technical report CSD-TR95-1536, Cornell University, pages 188 (August 1995)
4. Jha, S.K.: Design of a distributed reachability algorithm for analysis of linear hybrid automata. CoRR, abs/0710.3764 (2007)
5. 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)
6. Li, X., Jha, S.K., Bu, L.: Towards an Efficient Path-Oriented Tool for Bounded Reachability analysis of Linear Hybrid Systems using Linear Programming. In:BMC(2006)