Introduction to HOL: a theorem proving environment for higher order logic
Introduction to HOL: a theorem proving environment for higher order logic
Theoretical Computer Science
The algorithmic analysis of hybrid systems
Theoretical Computer Science - Special issue on hybrid systems
What's decidable about hybrid automata?
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Linear phase-portrait approximations for nonlinear hybrid systems
Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
Model checking
Concurrency verification: introduction to compositional and noncompositional methods
Concurrency verification: introduction to compositional and noncompositional methods
Hybrid Systems I
Proceedings of the First International Workshop on Hybrid Systems: Computation and Control
HSCC '98 Proceedings of the First International Workshop on Hybrid Systems: Computation and Control
Lazy Compositional Verification
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
Prooving Safety Properties of Hybrid Systems
ProCoS Proceedings of the Third International Symposium Organized Jointly with the Working Group Provably Correct Systems on Formal Techniques in Real-Time and Fault-Tolerant Systems
A Compositional Approach to the Design of Hybrid Systems
Hybrid Systems
Integration Graphs: A Class of Decidable Hybrid Systems
Hybrid Systems
Deductive Verification of Hybrid Systems Using STeP
HSCC '98 Proceedings of the First International Workshop on Hybrid Systems: Computation and Control
Reachability Verification for Hybrid Automata
HSCC '98 Proceedings of the First International Workshop on Hybrid Systems: Computation and Control
HSCC '01 Proceedings of the 4th International Workshop on Hybrid Systems: Computation and Control
Verifying Hybrid Systems Modeled as Timed Automata: A Case Study
HART '97 Proceedings of the International Workshop on Hybrid and Real-Time Systems
Hybrid Systems' Properties - Classification and Relation to Computer Science
Computer Aided Systems Theory - EUROCAST 2001-Revised Papers
Uniformity for the Decidability of Hybrid Automata
SAS '96 Proceedings of the Third International Symposium on Static Analysis
Assertional Specification and Verification Using PVS of the Steam Boiler Control System
Formal Methods for Industrial Applications, Specifying and Programming the Steam Boiler Control (the book grow out of a Dagstuhl Seminar, June 1995).
Algorithmic Analysis of Nonlinear Hybrid Systems
Proceedings of the 7th International Conference on Computer Aided Verification
PVS: A Prototype Verification System
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Hybrid Systems' Properties - Classification and Relation to Computer Science
Computer Aided Systems Theory - EUROCAST 2001-Revised Papers
Automated machine-checked hybrid system safety proofs
ITP'10 Proceedings of the First international conference on Interactive Theorem Proving
| Hi-index | 0.00 |
Hybrid systems are a well-established mathematical model for embedded systems. Such systems, which combine discrete and continuous behavior, are increasingly used in safety-critical applications. To guarantee safe functioning, formal verification techniques are crucial. While research in this area concentrates on model checking, deductive techniques attracted less attention. In this paper we use the general purpose theorem prover PVS for the rigorous formalization and analysis of hybrid systems. To allow for machine-assisted proofs, we implement a deductive assertional proof method within PVS. The sound and complete proof system allows modular proofs in that it comprises a proof rule for the parallel composition. Besides hybrid systems and the proof system, a number of examples are formalized within PVS.