X
feed icon rss

Your email was sent successfully. Check your inbox.

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

Proceed reservation?

Export
Filter
Type of Medium
Language
Region
Library
Years
Person/Organisation
Subjects(RVK)
Keywords
Access
  • 1
    Online Resource
    Online Resource
    Temporal logics in computer science : finite-state systems (2016)
    Cambridge : Cambridge University Press
    Details
    UID:
    gbv_883306433
    Format: 1 Online-Ressource (viii, 744 pages)
    ISBN: 9781139236119
    Series Statement: Cambridge tracts in theoretical computer science 58
    Content: This comprehensive text provides a modern and technically precise exposition of the fundamental theory and applications of temporal logics in computer science. Part I presents the basics of discrete transition systems, including constructions and behavioural equivalences. Part II examines the most important temporal logics for transition systems and Part III looks at their expressiveness and complexity. Finally, Part IV describes the main computational methods and decision procedures for model checking and model building - based on tableaux, automata and games - and discusses their relationships. The book contains a wealth of examples and exercises, as well as an extensive annotated bibliography. Thus, the book is not only a solid professional reference for researchers in the field but also a comprehensive graduate textbook that can be used for self-study as well as for teaching courses.
    Note: Title from publisher's bibliographic system (viewed on 27 Oct 2016)
    Additional Edition: ISBN 9781107028364
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 9781107028364
    Additional Edition: Erscheint auch als Druck-Ausgabe Demri, Stéphane, 1967 - Temporal logics in computer science Cambridge : Cambridge University Press, 2016 ISBN 1107028361
    Additional Edition: ISBN 9781107028364
    Language: English
    Subjects: Computer Science
    RVK:
    ST 125
    Keywords: Temporale Logik ; Informatik
    DOI: 10.1017/CBO9781139236119
    URL: Volltext  (lizenzpflichtig)
    URL: Inhaltstext
    Author information: Lange, Martin 1974-
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Online Access
    Open Access Request
    Stabi Berlin
    UB Potsdam
  • 2
    Book
    Book
    Temporal logics in computer science : finite-state systems (2016)
    Cambridge : Cambridge University Press
    Details
    UID:
    b3kat_BV043949894
    Format: viii, 744 Seiten , Illustrationen
    ISBN: 9781107028364
    Series Statement: Cambridge tracts in theoretical computer science 58
    Content: This comprehensive text provides a modern and technically precise exposition of the fundamental theory and applications of temporal logics in computer science. Part I presents the basics of discrete transition systems, including constructions and behavioural equivalences. Part II examines the most important temporal logics for transition systems and Part III looks at their expressiveness and complexity. Finally, Part IV describes the main computational methods and decision procedures for model checking and model building - based on tableaux, automata and games - and discusses their relationships. The book contains a wealth of examples and exercises, as well as an extensive annotated bibliography. Thus, the book is not only a solid professional reference for researchers in the field but also a comprehensive graduate textbook that can be used for self-study as well as for teaching courses
    Language: English
    Subjects: Computer Science
    RVK:
    ST 125
    Keywords: Temporale Logik ; Informatik
    URL: Inhaltstext
    Author information: Lange, Martin 1974-
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Book
    UB Potsdam get availability status
    TU Berlin get availability status
  • 3
    Online Resource
    Online Resource
    Temporal logics in computer science : finite-state systems (2016)
    Cambridge :Cambridge University Press,
    Details
    UID:
    almafu_9960119062302883
    Format: 1 online resource (viii, 744 pages) : , digital, PDF file(s).
    ISBN: 1-316-72716-5 , 1-316-72856-0 , 1-139-23611-3
    Series Statement: Cambridge tracts in theoretical computer science ; 58
    Content: This comprehensive text provides a modern and technically precise exposition of the fundamental theory and applications of temporal logics in computer science. Part I presents the basics of discrete transition systems, including constructions and behavioural equivalences. Part II examines the most important temporal logics for transition systems and Part III looks at their expressiveness and complexity. Finally, Part IV describes the main computational methods and decision procedures for model checking and model building - based on tableaux, automata and games - and discusses their relationships. The book contains a wealth of examples and exercises, as well as an extensive annotated bibliography. Thus, the book is not only a solid professional reference for researchers in the field but also a comprehensive graduate textbook that can be used for self-study as well as for teaching courses.
    Note: Title from publisher's bibliographic system (viewed on 27 Oct 2016). , Cover -- Half title -- Series -- Title -- Copyright -- Contents -- 1 Introduction -- 1.1 Temporal Logics and Computer Science: A Brief Overview -- 1.2 Structure and Summary of the Book Content -- 1.3 Using the Book for Teaching or Self-Study -- Part I Models -- 2 Preliminaries and Background I -- 2.1 Sets and Relations -- 2.2 Some Fundamental Preliminaries -- 3 Transition Systems -- 3.1 Basic Concepts -- 3.2 Reachability -- 3.3 Bisimulation Relations -- 3.4 Bisimilarity -- 3.5 Trace Equivalence -- 3.6 Exercises -- 3.7 Bibliographical Notes -- Part II Logics -- 4 Preliminaries and Background II -- 4.1 Preliminaries on Modal Logic -- 4.2 Logical Decision Problems -- 4.3 Expressive Power -- 4.4 Deductive Systems -- 5 Basic Modal Logics -- 5.1 The Basic Modal Logic BML -- 5.2 Renaming and Normal Forms -- 5.3 Modal and Bisimulation Equivalence -- 5.4 Model Checking -- 5.5 Satisfiability and the Tree Model Property -- 5.6 The Basic Tense Logic BTL -- 5.7 Axiomatic Systems -- 5.8 Exercises -- 5.9 Bibliographical Notes -- 6 Linear-Time Temporal Logics -- 6.1 Syntax and Semantics on Linear Models -- 6.2 Logical Decision Problems -- 6.3 The Small Model Property -- 6.4 Decision Procedures -- 6.5 Adding Past-Time Operators -- 6.6 Invariance Properties -- 6.7 Extensions of LTL -- 6.8 An Axiomatic System for LTL -- 6.9 Exercises -- 6.10 Bibliographical Notes -- 7 Branching-Time Temporal Logics -- 7.1 A Hierarchy of Branching-Time Logics -- 7.2 Bisimulation Invariance -- 7.3 Model Checking -- 7.4 Some Fragments and Extensions of CTL[sup(*)] -- 7.5 Axiomatic Systems -- 7.6 Exercises -- 7.7 Bibliographical Notes -- 8 The Modal Mu-Calculus -- 8.1 Fixpoint Quantifiers -- 8.2 Fixpoint Iteration -- 8.3 The Structural Complexity of Formulae -- 8.4 Model-Checking Games -- 8.5 Bisimulation Invariance -- 8.6 The Second-Order Nature of Temporal Logics -- 8.7 Variants. , 8.8 Exercises -- 8.9 Bibliographical Notes -- 9 Alternating-Time Temporal Logics -- 9.1 Concurrent Multiagent Transition Systems -- 9.2 Temporal Logics for Concurrent Game Models -- 9.3 Logical Decision Problems -- 9.4 Exercises -- 9.5 Bibliographical Notes -- Part III Properties -- 10 Expressiveness -- 10.1 Embeddings among Linear-Time Logics -- 10.2 Embeddings among Branching-Time Logics -- 10.3 Separation Results -- 10.4 Exercises -- 10.5 Bibliographical Notes -- 11 Computational Complexity -- 11.1 Proving Lower Bounds -- 11.2 Linear-Time Temporal Logics -- 11.3 Branching-Time Temporal Logics -- 11.4 An Overview of Completeness Results -- 11.5 Exercises -- 11.6 Bibliographical Notes -- Part IV Methods -- 12 Frameworks for Decision Procedures -- 12.1 A Brief Introduction to Three Methodologies -- 12.2 The Frameworks Compared -- 13 Tableaux-Based Decision Methods -- 13.1 A Generic Incremental Tableau Construction -- 13.2 Tableaux for LTL -- 13.3 Tableaux for TLR and CTL -- 13.4 Exercises -- 13.5 Bibliographical Notes -- 14 The Automata-Based Approach -- 14.1 Introduction to Nondeterministic Büchi Automata -- 14.2 From LTL Formulae to Automata -- 14.3 Introduction to Alternating Automata on Words -- 14.4 From LTL Formulae to Alternating Büchi Automata -- 14.5 Extensions of LTL -- 14.6 Tree Automata for Branching-Time Logics -- 14.7 Alternating Tree Automata and CTL -- 14.8 Exercises -- 14.9 Bibliographical Notes -- 15 The Game-Theoretic Framework -- 15.1 Parity Games -- 15.2 Constructions for Automata on Infinite Words -- 15.3 Model Checking -- 15.4 Satisfiability Checking -- 15.5 Exercises -- 15.6 Bibliographical Notes -- References -- Index.
    Additional Edition: ISBN 1-107-02836-1
    Language: English
    URL: https://doi.org/10.1017/CBO9781139236119
    URL: https://doi.org/10.1017/CBO9781139236119
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    HU Berlin
    FU Berlin
Nothing or not found what you are looking for? Please check your search query or use the Interlibrary Loan Search.
Did you mean 9781107023864?
Did you mean 9781107018334?
Did you mean 9781107002364?
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages