Verification of Reactive Systems

Formal Methods and Algorithms
1. Auflage. Softcover version of original hardcover Auflage 2004
ISBN: 978-3-642-05555-3
Verlag: Springer

Buch, Englisch, 602 Seiten, Previously published in hardcover, Format (B × H): 155 mm x 235 mm, Gewicht: 1037 g

Reihe: Texts in Theoretical Computer Science. An EATCS Series

This book is a solid foundation of the most important formalisms used for specification and verification of reactive systems. In particular, the text presents all important results on m-calculus, w-automata, and temporal logics, shows the relationships between these formalisms and describes state-of-the-art verification procedures for them. It also discusses advantages and disadvantages of these formalisms, and shows up their strengths and weaknesses. Most results are given with detailed proofs, so that the presentation is almost self-contained.

Includes all definitions without relying on other material

Proves all theorems in detail

Presents detailed algorithms in pseudo-code for verification as well as translations to other formalisms

Zielgruppe

Graduate

Autoren/Hrsg.

Schneider, Klaus

Fachgebiete

• Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Software Engineering Objektorientierte Softwareentwicklung
• Mathematik | Informatik Mathematik Mathematik Interdisziplinär Systemtheorie
• Interdisziplinäres Wissenschaften Wissenschaften: Forschung und Information Kybernetik, Systemtheorie, Komplexe Systeme
• Mathematik | Informatik EDV | Informatik Informatik Logik, formale Sprachen, Automaten

Inhaltsverzeichnis

1 Introduction.- 2 A Unified Specification Language.- 3 Fixpoint Calculi.- 4 Finite Automata.- 5 Temporal Logics.- 6 Predicate Logic.- 7 Conclusions.- A Binary Decision Diagrams.- A.1 Basic Definitions.- A.2 Basic Algorithms on BDDs.- A.3 Minimization of BDDs Using Care Sets.- A.4 Computing Successors and Predecessors.- A.5 Variable Reordering.- A.6 Final Remarks.- B.1 A Partial Local Model Checking Procedure.- B.2 A Complete Local Model Checking Procedure.- C Reduction of Structures.- C.1 Galois Connections and Simulations.- C.1.1 Basic Properties of Galois Connections.- C.1.2 Galois Simulation.- C.2 Abstract Structures and Preservation Results.- C.3 Optimal and Faithful Abstractions.- C.4 Data Abstraction.- C.4.1 Abstract Interpretation of Structures.- C.4.2 Abstract Specifications.- C.5 Symmetry and Model Checking.- C.5.1 Symmetries of Structures.- C.5.2 Symmetries in the Specification.- References.

Über Autor(innen)

Klaus Schneider is working since 10 years on the specification and verification of reactive systems. Starting as a research assistant in 1992 at the university of Karlsruhe, he worked on the verification of hardware circuits with higher order logic theorem provers. After receiving his PhD in 1996, he focused his research topics on design, specification, and verification of reactive systems. His research group made a lot of important contributions to still active research areas. The book is based on his habilitation in 2001. Since 2002, the author is professor in computer science at the university of Kaiserslautern.