Verification of Reactive Systems : Formal Methods and Algorithms (Texts in Theoretical Computer Science, An EATCS Series) （2004. XIV, 600 p. w. 149 figs. 24 cm）

個数：

Verification of Reactive Systems : Formal Methods and Algorithms (Texts in Theoretical Computer Science, An EATCS Series) （2004. XIV, 600 p. w. 149 figs. 24 cm）

  • 在庫がございません。海外の書籍取次会社を通じて出版社等からお取り寄せいたします。
    通常6～9週間ほどで発送の見込みですが、商品によってはさらに時間がかかることもございます。
    【重要ご説明事項】
    1. 納期遅延や、ご入手不能となる場合がございます。
    2. 複数冊ご注文の場合、分割発送となる場合がございます。
    3. 美品のご指定は承りかねます。
  • 【入荷遅延について】
    世界情勢の影響により、海外からお取り寄せとなる洋書・洋古書の入荷が、表示している標準的な納期よりも遅延する場合がございます。
    おそれいりますが、あらかじめご了承くださいますようお願い申し上げます。
  • ◆画像の表紙や帯等は実物とは異なる場合があります。
  • ◆ウェブストアでの洋書販売価格は、弊社店舗等での販売価格とは異なります。
    また、洋書販売価格は、ご注文確定時点での日本円価格となります。
    ご注文確定後に、同じ洋書の販売価格が変動しても、それは反映されません。
  • 製本 Hardcover:ハードカバー版／ページ数 500 p.
  • 商品コード 9783540002963

基本説明

Covers many formalisms like u-calculus, w-automata, and temporal logics and has special emphasis on the relationship between these formalism.

Full Description

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.

Contents

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.