Completing the temporal picture
Selected papers of the 16th international colloquium on Automata, languages, and programming
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
The algorithmic analysis of hybrid systems
Theoretical Computer Science - Special issue on hybrid systems
Verifying clocked transition systems
Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
Logics vs. automata (extended abstract): the hybrid case
Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
Impartiality, Justice and Fairness: The Ethics of Concurrent Termination
Proceedings of the 8th Colloquium on Automata, Languages and Programming
Visual Verification of Reactive Systems
TACAS '97 Proceedings of the Third International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Hybrid Diagrams: A Deductive-Algorithmic Approach to Hybrid System Verification
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
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
Hybrid Systems
An Extended Duration Calculus for Hybrid Real-Time Systems
Hybrid Systems
Verifying omega-Regular Properties for a Subclass of Linear Hybrid Systems
Proceedings of the 7th International Conference on Computer Aided Verification
From Duration Calculus To Linear Hybrid Automata
Proceedings of the 7th International Conference on Computer Aided Verification
Temporal Verification by Diagram Transformations
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Proceedings of the Real-Time: Theory in Practice, REX Workshop
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Using mappings to prove timing properties
Distributed Computing
| Hi-index | 5.23 |
Hybrid systems provide a formal model for physical systems controlled by discrete-state controllers. To help with the design of correct controllers, we present a methodology that enables the verification of linear-time temporal logic properties of general, non-linear hybrid systems. The methodology is based on the deductive transformation and algorithmic checking of hybrid diagrams.Hybrid diagrams are graphs whose vertices and edges are labeled with first-order assertions; they represent system abstractions, together with the progress properties that have been proved about them. The verification process begins with the automatic construction of an initial diagram, whose behavior coincides with that of the hybrid system. The proof of a specification is constructed by applying a series of diagram transformations to this initial diagram. The transformations preserve behavior containment, and the aim of the transformations is to obtain a diagram that can be algorithmically shown to satisfy the specification. Whenever the algorithmic check of a diagram fails, the check returns guidance for the further transformation of the diagram, or indications about possible counterexamples to the specification.We present four rules for transforming diagrams: each rule enables the study of a certain class of temporal logic properties. While some rules can be applied unconditionally, others require the proof of first-order verification conditions. We prove that the rules lead to the first verification methodology for general hybrid systems that is complete (relative to first-order reasoning) for proving specifications expressed in first-order linear-time temporal logic, provided no temporal operator appears in the scope of a quantifier.