Verification of Digital and Hybrid Systems

This book grew out of a NATO Advanced Study Institute summer school that was held in Antalya, TUrkey from 26 May to 6 June 1997. The purpose of the summer school was to expose recent advances in the formal verification of systems composed of both logical and continuous time components. The course was structured in two parts. The first part covered theorem-proving, system automaton models, logics, tools, and complexity of verification. The second part covered modeling and verification of hybrid systems, i. e. , systems composed of a discrete event part and a continuous time part that interact with each other in novel ways. Along with advances in microelectronics, methods to design and build logical systems have grown progressively complex. One way to tackle the problem of ensuring the error-free operation of digital or hybrid systems is through the use of formal techniques. The exercise of comparing the formal specification of a logical system namely, what it is supposed to do to its formal operational description-what it actually does!-in an automated or semi-automated manner is called verification. Verification can be performed in an after-the-fact manner, meaning that after a system is already designed, its specification and operational description are regenerated or modified, if necessary, to match the verification tool at hand and the consistency check is carried out.

Tutorial overview of state of the art in computer-aided verification Emphasis on industrial applications and hybrid systems Leading international experts present latest research Includes supplementary material: sn.pub/extras

Klappentext

This state-of-the-art tutorial overview of computer-aided verification, hybrid systems, and publicly available tools for design and verification is based on a NATO workshop. It has two parts. Part 1 addresses the basics of computer-aided verification of discrete event systems from two perspectives: automated theorem proving and model checking. In model checking, the essential problem of computational complexity is addressed, and the basic heuristics for dealing with this problem are presented. Part 2 formulates and classifies hybrid systems that capture continuous dynamics interacting with activated discrete event interruptions modeled by automata, and presents and discusses properties relevant to design and verification such as decidability, complexity, and expressibility for computer tools. The theory is illustrated with real-life examples. One novel and industrially relevant example is that of an intelligent highway transport system.

Inhalt
I. Discrete Event System Verification.- 1. Overview of Verification.- 2. General Purpose Theorem Proving Methods in the Verification of Digital Hardware and Software.- 3. Temporal Logic and Model Checking.- 4. Model Checking Using Automata Theory.- 5. Complexity Issues in Automata Theoretic Verification.- 6. Symbolic Model Checking.- 7. Compositional Systems and Methods.- 8. Symmetry and Model Checking.- 9. Partial Order Reductions.- 10. Probabilistic Model Checking: Formalisms and Algorithms for Discrete and Real-time Systems.- 11. Formal Verification in a Commercial Setting.- II. Hybrid Systems: Modeling and Verification.- 12. Timed Automata.- 13. The Theory of Hybrid Automata.- 14. On the Composition of Hybrid Systems.- 15. Reach Set Computation Using Optimal Control.- 16. Control for a Class of Hybrid Systems.- 17. The SHIFT Programming Language and Run-time System for Dynamic Networks of Hybrid Automata.- 18. The Teja System for Real-Time Dynamic Event Management.- 19. Automated Highway Systems: an Example of Hierarchical Control.