200 likes | 223 Views
This doctoral defense discusses the verification of hybrid systems using simulation relations. It explores the challenges of formal verification, computational complexity, and the solution of abstraction and compositionality.
E N D
Compositional Verification of Hybrid SystemsUsing Simulation RelationsDoctorate Defense Goran Frehse Radboud Universiteit, Nijmegen, Oct. 10, 2005
Example 1: Überlingen, July 1, 2002 • Boeing & Tupolew crossing • 21:33:03 • Alarm from Collision Avoidance System (TCAS) B757-200 TU154M !
Example 1: Überlingen, July 1, 2002 • Boeing & Tupolew crossing • 21:33:03 • Alarm from Collision Avoidance System (TCAS) • 21:34:49 • Human controller command B757-200 TU154M !
Example 1: Überlingen, July 1, 2002 • Boeing & Tupolew crossing • 21:33:03 • Alarm from Collision Avoidance System (TCAS) • 21:34:49 • Human controller command • 21:34:56 • TCAS recommendation B757-200 TU154M !
Example 1: Überlingen, July 1, 2002 • Boeing & Tupolew crossing • 21:33:03 • Alarm from Collision Avoidance System (TCAS) • 21:34:49 • Human controller command • 21:34:56 • TCAS recommendation • 21:35:32 • Collision B757-200 TU154M !
Example 1: Überlingen, July 1, 2002 • Boeing & Tupolew crossing • 21:33:03 • Alarm from Collision Avoidance System (TCAS) • 21:34:49 • Human controller command • 21:34:56 • TCAS recommendation • 21:35:32 • Collision B757-200 TU154M Official Recommendation: “pilots are to obey and follow TCAS advisories, regardless of whether contrary instruction is given” Trust a computer!? !
Model of Environment Model of Software Formal Verification Hybrid System • Characteristics • mathematical rigour • sound proofs & algorithms • Hybrid System • continuous environment • discrete software • Problems • only computable for certain types of models • must check all possibilities • computational complexity • Solution • abstraction • compositionality Precise Specification
Model of Environment Model of Software Formal Verification Hybrid System • Characteristics • mathematical rigour • sound proofs & algorithms • Hybrid System • continuous environment • discrete software • Problems • only computable for certain types of models • must check all possibilities • computational complexity • Solution • abstraction • compositionality Precise Specification Proof (algorithmic)
Model of Environment Model of Software Formal Verification Hybrid System • Characteristics • mathematical rigour • sound proofs & algorithms • Hybrid System • continuous environment • discrete software • Problems • only computable for certain types of models • must check all possibilities • computational complexity • Solution • abstraction • compositionality Precise Specification Proof (algorithmic) TCAS verified in part Livadas, Lygeros, Lynch, ‘00 Guaranteed Correctness
Example 2: Join Manoeuvre [Tomlin et al.] • Traffic Coordination Problem • join paths at different speed • Goals • avoid collision • join with sufficient separation
Example 2: Join Manoeuvre [Tomlin et al.] • Traffic Coordination Problem • join paths at different speed • Goals • avoid collision • join with sufficient separation • Models • Environment: Planes • Software: Controller • switches fast/slow • Specification • keep min. distance
Abstraction and Simulation Relations • Goal • check all possibilities • Abstraction • simplified model • here: linear bounds on direction disturbances
Abstraction and Simulation Relations • Goal • check all possibilities • Abstraction • simplified model • here: linear bounds on direction • bounds on trajectories disturbances bounds on direction original trajectory bounds on trajectories of abstraction
Abstraction and Simulation Relations • Goal • check all possibilities • Abstraction • simplified model • here: linear bounds on direction • bounds on trajectories • Simulation Relation • formal relationship between original and abstraction • everything possible in implementation is also possible in abstraction • specification = abstraction disturbances bounds on direction original trajectory bounds on trajectories of abstraction
Original Plane Abstract Plane satisfies Original Controller Abstract Controller while active do if altitude > 13000 check distance else if speed >= 10 check heading check distance else warning end while while active do check distance end while satisfies Compositionality • From Components to Systems • Simulation relations must hold after composition
Original Plane Abstract Plane satisfies Original Controller Abstract Controller while active do if altitude > 13000 check distance else if speed >= 10 check heading check distance else warning end while while active do check distance end while satisfies Compositionality • From Components to Systems • Simulation relations must hold after composition Original Plane Original Controller Abstract Plane Abstract Controller sat. composed system composed abstraction
Original Plane Abstract Plane satisfies Original Controller Abstract Controller while active do if altitude > 13000 check distance else if speed >= 10 check heading check distance else warning end while while active do check distance end while satisfies Compositionality • From Components to Systems • Simulation relations must hold after composition • Benefits • modular verification • advanced deduction techniques possible • Difficulty • formalisms must fit together • hybrid system • simulation relation • composition Original Plane Original Controller Abstract Plane Abstract Controller sat. composed system composed abstraction
Contribution of this Thesis • Formal Framework for Compositional Verification • simulation relations for hybrid systems • semi-computable for linear bounds collision possible! time safety margin
Contribution of this Thesis • Formal Framework for Compositional Verification • simulation relations for hybrid systems • semi-computable for linear bounds • Verification Tool: PHAVer (Polyhedral Hybrid Automaton Verifier) • compute simulation relations and reachable states • most powerful verification tool for hybrid systems collision possible! time safety margin
Contribution of this Thesis • Formal Framework for Compositional Verification • simulation relations for hybrid systems • semi-computable for linear bounds • Verification Tool: PHAVer (Polyhedral Hybrid Automaton Verifier) • compute simulation relations and reachable states • most powerful verification tool for hybrid systems • Future Work • compositional over-approximations (submitted) • efficiency & applications collision possible! time safety margin