HOME > Detail View

Detail View

Verification of reactive systems : formal methods and algorithms

Verification of reactive systems : formal methods and algorithms (Loan 3 times)

Material type
단행본
Personal Author
Schneider, Klaus, 1967-
Title Statement
Verification of reactive systems : formal methods and algorithms / Klaus Schneider.
Publication, Distribution, etc
Berlin ;   New York :   Springer,   c2004.  
Physical Medium
xiv, 600 p. : ill. ; 25 cm.
Series Statement
Texts in theoretical computer science
ISBN
3540002960 (alk. paper)
Bibliography, Etc. Note
Includes bibliographical references (p. [561]-589) and index.
Subject Added Entry-Topical Term
Computer systems -- Verification. Formal methods (Computer science) Computer algorithms.
000 01106camuu22003134a 4500
001 000000885378
005 20040622170333
008 030930s2004 gw a b 001 0 eng
010 ▼a 2003066407
015 ▼a GBA4-00520
020 ▼a 3540002960 (alk. paper)
040 ▼a DLC ▼c DLC ▼d OHX ▼d UKM ▼d C#P ▼d 211009
042 ▼a pcc
049 ▼a KUBA ▼l 121095329 ▼f 과학
050 0 0 ▼a QA76.76.V47 ▼b S34 2004
072 7 ▼a QA ▼2 lcco
082 0 0 ▼a 004.2/1 ▼2 22
090 ▼a 004.21 ▼b S359v
100 1 ▼a Schneider, Klaus, ▼d 1967-
245 1 0 ▼a Verification of reactive systems : ▼b formal methods and algorithms / ▼c Klaus Schneider.
260 ▼a Berlin ; ▼a New York : ▼b Springer, ▼c c2004.
300 ▼a xiv, 600 p. : ▼b ill. ; ▼c 25 cm.
440 0 ▼a Texts in theoretical computer science
504 ▼a Includes bibliographical references (p. [561]-589) and index.
650 0 ▼a Computer systems ▼x Verification.
650 0 ▼a Formal methods (Computer science)
650 0 ▼a Computer algorithms.
938 ▼a Otto Harrassowitz ▼b HARR ▼n har035007105 ▼c 74.85 EUR

Holdings Information

No. Location Call Number Accession No. Availability Due Date Make a Reservation Service
No. 1 Location Science & Engineering Library/Sci-Info(Stacks2)/ Call Number 004.21 S359v Accession No. 121095329 Availability Available Due Date Make a Reservation Service B M

Contents information

Table of 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.


Information Provided By: : Aladin

New Arrivals Books in Related Fields

Isaacson, Walter (2022)
Forouzan, Behrouz A. (2022)