Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Book
    Book
    Berlin [u.a.] :Springer,
    UID:
    almahu_BV016523555
    Format: XIV, 600 S. : graph. Darst.
    ISBN: 3-540-00296-0
    Series Statement: Texts in theoretical computer science
    Language: English
    Subjects: Computer Science
    RVK:
    RVK:
    RVK:
    Keywords: Reaktives System ; Verifikation ; Formale Spezifikationstechnik ; Model Checking ; Endlicher Automat ; Temporale Logik
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Online Resource
    Online Resource
    Berlin : Springer
    UID:
    gbv_749296135
    Format: Online-Ressource (XIV, 602 p) , digital
    Edition: Springer eBook Collection. Computer Science
    ISBN: 9783662107782
    Series Statement: Texts in Theoretical Computer Science, An EATCS Series
    Content: 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
    Additional Edition: ISBN 9783642055553
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 9783642055553
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 9783540002963
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 9783662107799
    Language: English
    URL: Volltext  (lizenzpflichtig)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Online Resource
    Online Resource
    Berlin, Heidelberg :Springer Berlin Heidelberg :
    UID:
    almahu_9948621658002882
    Format: XIV, 602 p. , online resource.
    Edition: 1st ed. 2004.
    ISBN: 9783662107782
    Series Statement: Texts in Theoretical Computer Science. An EATCS Series,
    Content: 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.
    Note: 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.
    In: Springer Nature eBook
    Additional Edition: Printed edition: ISBN 9783642055553
    Additional Edition: Printed edition: ISBN 9783540002963
    Additional Edition: Printed edition: ISBN 9783662107799
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Did you mean 3540060960?
Did you mean 3540602860?
Did you mean 3546002962?
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages