TY - CHAP
T1 - Symbolic Analysis of Linear Hybrid Automata – 25 Years Later
AU - Frehse, Goran
AU - Giacobbe, Mirco
AU - Zaffanella, Enea
PY - 2022/12/29
Y1 - 2022/12/29
N2 - We present a collection of advances in the algorithmic verification of hybrid automata with piecewise linear derivatives, so-called Linear Hybrid Automata. New ways to represent and compute with polyhedra, in combination with heuristic algorithmic improvements, have led to considerable speed-ups in checking safety properties through set propagation. We also showcase a CEGAR-style approach that iteratively constructs a polyhedral abstraction. We illustrate the efficiency and scalability of both approaches with two sets of benchmarks.
AB - We present a collection of advances in the algorithmic verification of hybrid automata with piecewise linear derivatives, so-called Linear Hybrid Automata. New ways to represent and compute with polyhedra, in combination with heuristic algorithmic improvements, have led to considerable speed-ups in checking safety properties through set propagation. We also showcase a CEGAR-style approach that iteratively constructs a polyhedral abstraction. We illustrate the efficiency and scalability of both approaches with two sets of benchmarks.
U2 - 10.1007/978-3-031-22337-2_3
DO - 10.1007/978-3-031-22337-2_3
M3 - Chapter
SN - 9783031223365
T3 - Lecture Notes in Computer Science
SP - 39
EP - 60
BT - Principles of Systems Design
A2 - Raskin, Jean-François
A2 - Chatterjee, Krishnendu
A2 - Doyen, Laurent
A2 - Majumdar, Rupak
PB - Springer
CY - Cham
ER -