Symbolic Reachability Analysis of Lazy Linear Hybrid Automata

DOI10.1007/978-3-540-75454-1_18zbMath1141.93352OpenAlexW2165214723MaRDI QIDQ3510848

Bryan A. Brady, Susmit Jha, Sanjit A. Seshia

Publication date: 3 July 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-75454-1_18

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30)

Related Items

Exact State Set Representations in the Verification of Linear Hybrid Systems with Large Discrete State Space, PTIME parametric verification of safety properties for reasonable linear hybrid automata, Exact and fully symbolic verification of linear hybrid automata with large discrete state spaces, SAT-LP-IIS joint-directed path-oriented bounded reachability analysis of linear hybrid automata, Quantifier-free encoding of invariants for hybrid systems, Synthesis and infeasibility analysis for stochastic models of biochemical systems using statistical model checking and abstraction refinement, Towards Component Based Design of Hybrid Systems: Safety and Stability

Uses Software

• PHAVer