Forward and backward simulations II.: timing-based systems
Information and Computation
PVS: A Prototype Verification System
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Information and Computation
Modeling and Verifying a Lego Car Using Hybrid I/O Automata
QSIC '03 Proceedings of the Third International Conference on Quality Software
DSN '04 Proceedings of the 2004 International Conference on Dependable Systems and Networks
The Theory of Timed I/O Automata (Synthesis Lectures in Computer Science)
The Theory of Timed I/O Automata (Synthesis Lectures in Computer Science)
Safety verification of model helicopter controller using hybrid input/output automata
HSCC'03 Proceedings of the 6th international conference on Hybrid systems: computation and control
FM'06 Proceedings of the 14th international conference on Formal Methods
Learning and Detecting Emergent Behavior in Networks of Cardiac Myocytes
HSCC '08 Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control
Verifying average dwell time of hybrid systems
ACM Transactions on Embedded Computing Systems (TECS)
A Formalized Theory for Verifying Stability and Convergence of Automata in PVS
TPHOLs '08 Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics
Formal Verification of Curved Flight Collision Avoidance Maneuvers: A Case Study
FM '09 Proceedings of the 2nd World Congress on Formal Methods
ICCPS '12 Proceedings of the 2012 IEEE/ACM Third International Conference on Cyber-Physical Systems
A small model theorem for rectangular hybrid automata networks
FMOODS'12/FORTE'12 Proceedings of the 14th joint IFIP WG 6.1 international conference and Proceedings of the 32nd IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems
Formal verification of distributed aircraft controllers
Proceedings of the 16th international conference on Hybrid systems: computation and control
| Hi-index | 0.00 |
In this paper, we propose a new approach for formal verification of hybrid systems. To do so, we present a new refinement proof technique, a weak refinement using step invariants. As a case study of the approach, we conduct formal verification of the safety properties of NASA's Small Aircraft Transportation System (SATS) landing protocol. A new model is presented using the timed I/O automata (TIOA) framework [1], and key safety properties are verified. Using the new refinement technique presented in the paper, we first carry over the safety verification results from the previous discrete model studied in [2] to the new model. We also present properties specific to the new model, such as lower bounds on the spacing of aircraft in specific areas of the airspace.