Description |
1 online resource |
Series |
Atlantis studies in computing ; 3 |
|
Atlantis studies in computing ; 3.
|
Contents |
880-01 Logics for Computations -- Graded Computation Tree Logic -- Minimal Model Quantifiers -- Logics for Strategies -- Reasoning About Strategies -- Relentful Strategic Reasoning |
|
880-01/(S Machine generated contents note: pt. I Logics for Computations -- 1. Graded Computation Tree Logic -- 1.1. Introduction -- 1.2. Preliminaries -- 1.3. Graded Computation Tree Logics -- 1.3.1. Syntax -- 1.3.2. Semantics -- 1.4. Path Equivalence Properties -- 1.4.1. Elementary Requirements -- 1.4.2. Temporal Requirements -- 1.4.3. Boolean Requirements -- 1.4.4. Main Properties -- 1.5. Prefix Path Equivalence -- 1.5.1. Definition and Properties -- 1.5.2. GCTL Versus GμCalculus Relationships -- 1.6. Alternating Tree Automata -- 1.6.1. Classic Automata -- 1.6.2. Automata with Satellite -- 1.7. GCTL Model Transformations -- 1.7.1. Binary Tree Model Encoding -- 1.7.2. Coherence Structure Satellites -- 1.8. GCTL Satisfiability -- 1.9. Discussion -- 2. Minimal Model Quantifiers -- 2.1. Introduction -- 2.2. Preliminaries -- 2.3. Computation Tree Logics with Minimal Model Quantifier -- 2.3.1. Syntax -- 2.3.2. Semantics -- 2.4. Expressiveness and Succinctness -- 2.5. Model Checking -- 2.6. Satisfiability -- 2.7. Discussion -- pt. II Logics in Computer Science -- 3. Reasoning About Strategies -- 3.1. Introduction -- 3.2. Preliminaries -- 3.3. Strategy Logic -- 3.3.1. Syntax -- 3.3.2. Semantics -- 3.4. Basic Properties -- 3.4.1. Basic Definitions -- 3.4.2. Positive Properties -- 3.4.3. Negative Properties -- 3.5. Strategy Quantification -- 3.6. Alternating Tree Automata -- 3.7. Model Checking -- 3.8. Satisfiability -- 3.9. Discussion -- 4. Relentful Strategic Reasoning -- 4.1. Introduction -- 4.2. Preliminaries -- 4.3. Memoryful Alternating-Time Temporal Logic -- 4.3.1. Syntax -- 4.3.2. Semantics -- 4.4. Expressiveness and Succinctness -- 4.5. Alternating Tree Automata -- 4.5.1. Classic Automata -- 4.5.2. Automata with Satellite -- 4.6. Decision Procedures -- 4.6.1. From Path Formulas to Satellite -- 4.6.2. Satisfiability -- 4.6.3. Model Checking -- 4.7. Discussion |
Summary |
In this monograph we introduce and examine four new temporal logic formalisms that can be used as specification languages for the automated verification of the reliability of hardware and software designs with respect to a desired behavior. The work is organized in two parts. In the first part two logics for computations, the graded computation tree logic and the computation tree logic with minimal model quantifiers are discussed. These have proved to be useful in describing correct executions of monolithic closed systems. The second part focuses on logics for strategies, strategy logic and memoryful alternating-time temporal logic, which have been successfully applied to formalize several properties of interactive plays in multi-entities systems modeled as multi-agent games |
Bibliography |
Includes bibliographical references and index |
Notes |
Print version record |
Subject |
Computer logic.
|
|
COMPUTERS -- Programming -- Open Source.
|
|
COMPUTERS -- Software Development & Engineering -- General.
|
|
COMPUTERS -- Software Development & Engineering -- Tools.
|
|
Lógica matemática
|
|
Computer logic
|
Form |
Electronic book
|
ISBN |
9789491216954 |
|
9491216953 |
|