Reachability for Linear Hybrid Automata Using Iterative Relaxation Abstraction
From MaRDI portal
Publication:3612979
DOI10.1007/978-3-540-71493-4_24zbMath1221.93115OpenAlexW1844911504MaRDI QIDQ3612979
Sumit Kumar Jha, James Weimer, Bruce H. Krogh, Edmund M. Clarke
Publication date: 11 March 2009
Published in: Hybrid Systems: Computation and Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-71493-4_24
Formal languages and automata (68Q45) Attainable sets, reachability (93B03) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30)
Related Items (8)
Hybrid automata-based CEGAR for rectangular hybrid systems ⋮ Symbolic analysis of linear hybrid automata -- 25 years later ⋮ SAT-LP-IIS joint-directed path-oriented bounded reachability analysis of linear hybrid automata ⋮ Counterexample-Guided Refinement of Template Polyhedra ⋮ Synthesis and infeasibility analysis for stochastic models of biochemical systems using statistical model checking and abstraction refinement ⋮ CTRL: extension of CTL with regular expressions and fairness operators to verify genetic regulatory networks ⋮ Counterexample Guided Path Reduction for Static Program Analysis ⋮ Refinement of Trace Abstraction
Uses Software
This page was built for publication: Reachability for Linear Hybrid Automata Using Iterative Relaxation Abstraction
