Logics in Computer Science

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.

Provides four extensions of classic temporal and strategic logics Comprises new results on expressiveness and succinctness of logics in computer science Includes new techniques for proving upper and lower computational bounds

Inhalt

Graded Computation Tree Logic.- Minimal Model Quantifiers.- Reasoning About Strategies.- Relentful Strategic Reasoning.- Appendix A Mathematical Notation.