Zur Startseite gehen
0,00 €*
Cover: 9783642055553 | Verification of Reactive Systems | Formal Methods and Algorithms | xiv
Dekorationsartikel gehören nicht zum Leistungsumfang.
Verification of Reactive Systems
Formal Methods and Algorithms
Taschenbuch von Klaus Schneider
Sprache: Englisch

53,49 €*

inkl. MwSt.

Versandkostenfrei per Post / DHL

Aktuell nicht verfügbar

Kategorien:
Beschreibung
Reactive systems are becoming more and more important for essentially all areas of technical and professional activities as well as for many areas of everyday life. The design of these systems is a great challenge and requires sound compromises between safety and time-to-market. To meet these needs, early design phases nowadays include verification of given specifications against system descriptions to find potential design errors as early as possible.

This book is devoted to the foundation of the most popular formal methods for the specification and verification of reactive systems. In particular, the µ-calculus, omega-automata, and temporal logics are covered in full detail; their relationship and state-of-the-art verification procedures based on these formal approaches are presented. Furthermore, the advantages and disadvantages of the formalisms from particular points of view are analyzed. Most results are given with detailed proofs, so that the presentation is almost self-contained.

This book is targeted to advanced students, lecturers and researchers in the area of formal methods.
Reactive systems are becoming more and more important for essentially all areas of technical and professional activities as well as for many areas of everyday life. The design of these systems is a great challenge and requires sound compromises between safety and time-to-market. To meet these needs, early design phases nowadays include verification of given specifications against system descriptions to find potential design errors as early as possible.

This book is devoted to the foundation of the most popular formal methods for the specification and verification of reactive systems. In particular, the µ-calculus, omega-automata, and temporal logics are covered in full detail; their relationship and state-of-the-art verification procedures based on these formal approaches are presented. Furthermore, the advantages and disadvantages of the formalisms from particular points of view are analyzed. Most results are given with detailed proofs, so that the presentation is almost self-contained.

This book is targeted to advanced students, lecturers and researchers in the area of formal methods.
Über den Autor

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.

Zusammenfassung
The book is a foundation of the most important formalisms used for specification and verification of reactive systems. In particular, it 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.
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.
Details
Erscheinungsjahr: 2010
Genre: Informatik
Rubrik: Naturwissenschaften & Technik
Medium: Taschenbuch
Reihe: Texts in Theoretical Computer Science. An EATCS Series
Inhalt: xiv
602 S.
19 s/w Illustr.
ISBN-13: 9783642055553
ISBN-10: 3642055559
Sprache: Englisch
Ausstattung / Beilage: Paperback
Einband: Kartoniert / Broschiert
Autor: Schneider, Klaus
Auflage: Softcover reprint of hardcover 1st ed. 2004
Hersteller: Springer-Verlag GmbH
Springer Berlin Heidelberg
Texts in Theoretical Computer Science. An EATCS Series
Maße: 235 x 155 x 34 mm
Von/Mit: Klaus Schneider
Erscheinungsdatum: 08.12.2010
Gewicht: 0,925 kg
Artikel-ID: 107082612
Über den Autor

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.

Zusammenfassung
The book is a foundation of the most important formalisms used for specification and verification of reactive systems. In particular, it 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.
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.
Details
Erscheinungsjahr: 2010
Genre: Informatik
Rubrik: Naturwissenschaften & Technik
Medium: Taschenbuch
Reihe: Texts in Theoretical Computer Science. An EATCS Series
Inhalt: xiv
602 S.
19 s/w Illustr.
ISBN-13: 9783642055553
ISBN-10: 3642055559
Sprache: Englisch
Ausstattung / Beilage: Paperback
Einband: Kartoniert / Broschiert
Autor: Schneider, Klaus
Auflage: Softcover reprint of hardcover 1st ed. 2004
Hersteller: Springer-Verlag GmbH
Springer Berlin Heidelberg
Texts in Theoretical Computer Science. An EATCS Series
Maße: 235 x 155 x 34 mm
Von/Mit: Klaus Schneider
Erscheinungsdatum: 08.12.2010
Gewicht: 0,925 kg
Artikel-ID: 107082612
Warnhinweis

Ähnliche Produkte

Diese Website verwendet Cookies, um eine bestmögliche Erfahrung bieten zu können. Mehr Informationen ...