A
André Platzer
Researcher at Carnegie Mellon University
Publications - 218
Citations - 6587
André Platzer is an academic researcher from Carnegie Mellon University. The author has contributed to research in topics: Hybrid system & Formal verification. The author has an hindex of 41, co-authored 209 publications receiving 5815 citations. Previous affiliations of André Platzer include Technische Universität München & University of Oldenburg.
Papers
More filters
Journal ArticleDOI
Computing differential invariants of hybrid systems as fixedpoints
André Platzer,Edmund M. Clarke +1 more
TL;DR: In this article, a fixed-point algorithm for verifying safety properties of hybrid systems with differential equations whose right-hand sides are polynomials in the state variables is presented.
Book ChapterDOI
European Train Control System: A Case Study in Formal Verification
André Platzer,Jan-David Quesel +1 more
TL;DR: It is proved that the ETCS protocol remains correct even in the presence of perturbation by disturbances in the dynamics, and that safety is preserved when a PI controlled speed supervision is used.
Book ChapterDOI
Formal Verification of Curved Flight Collision Avoidance Maneuvers: A Case Study
André Platzer,Edmund M. Clarke +1 more
TL;DR: A fully flyable variant of the roundabout collision avoidance maneuver is introduced and safety properties are verified by compositional verification, showing that formal verification of hybrid systems can scale to curved flight maneuvers required in aircraft control applications.
Proceedings ArticleDOI
Statistical Model Checking for Markov Decision Processes
TL;DR: This work develops an algorithm that resolves nond determinism probabilistically, and then uses multiple rounds of sampling and Reinforcement Learning to provably improve resolutions of nondeterminism with respect to satisfying a Bounded Linear Temporal Logic (BLTL) property.
Proceedings ArticleDOI
The Complete Proof Theory of Hybrid Systems
TL;DR: It is shown that, proof-theoretically, this is not the case that hybrid systems are more challenging than continuous dynamical systems and than discrete systems, and axiomatization is given, which enables flexible and provably perfect combinations of discrete reasoning with continuous reasoning that lift to all aspects of hybrid systems.