Temporal and Modal Logic

@inproceedings{Emerson1990TemporalAM,
  title={Temporal and Modal Logic},
  author={E. Allen Emerson},
  booktitle={Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics},
  year={1990}
}
  • E. Emerson
  • Published in
    Handbook of Theoretical…
    2 January 1991
  • Philosophy

Temporal logic

Temporal and Dynamic Logic

TLDR
An introductory survey of temporal and dynamic logics: logics for reasoning about how environments change over time, and how processes change their environments, starting with the seminal work of Prior is presented.

Expressive completeness of temporal logic of trees

  • H. Schlingloff
  • Philosophy, Computer Science
    J. Appl. Non Class. Logics
  • 1992
ABSTRACT Many temporal and modal logic languages can be regarded as subsets of first order logic, i.e. the semantics of a temporal logic formula is given as a first order condition on points of the

Logics of Time and Action

TLDR
An introductory survey of temporal and dynamic logics: logics for reasoning about how environments change over time, and how processes change their environments, starting with the seminal work of Prior is presented.

A survey on temporal logics for specifying and verifying real-time systems

  • Savas Konur
  • Philosophy, Computer Science
    Frontiers of Computer Science
  • 2013
TLDR
Decidability, axiomatizability, expressiveness, model checking results for each logic analysed are given and a comparison of features of the temporal logics discussed is provided.

A General Tableau Method for Propositional Interval Temporal Logics

TLDR
This paper provides BCDT + with a generic tableau method which combines features of explicit tableau methods for modal logics with constraint label management and the classical tableAU method for first-order logic, and proves its soundness and completeness.

First-Order Temporal Verification in Practice

TLDR
This paper presents a translation from temporal logics of knowledge into the monodic fragment of first-order temporal logic, a useful fragment that possesses good computational properties such as completeness and sometimes even decidability, and presents the translation, its correctness, and examples of its use.

Logics of Programs

  • D. KozenJ. Tiuryn
  • Philosophy
    Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics
  • 1990

Dynamic logic

TLDR
This book provides the first comprehensive introduction to Dynamic Logic, a system of remarkable unity that is theoretically rich as well as of practical value.

Alternating-time temporal logic

TLDR
This work introduces a third, more general variety of temporal logic: alternating-time temporal logic offers selective quantification over those paths that are possible outcomes of games, such as the game in which the system and the environment alternate moves.
...

References

SHOWING 1-10 OF 146 REFERENCES

Logics of Programs

  • D. KozenJ. Tiuryn
  • Philosophy
    Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics
  • 1990

Propositional Dynamic Logic of Regular Programs

Decidability and expressiveness of logics of processes

TLDR
It is shown that PDL is decidable only when processes are tree-like, in Parikh's sense, and that extending PDL by a concurrency operator, a global invariance operator and flowgraph programs, among others, adds no expressive power to PDL.

The tableau method for temporal logic: an overview

TLDR
An overview of the tableau decision method for propositional temporal logic and how it can be applied to other variants of temporal logic like branching time temporal Logic and extensions o f linear time temporal logic are presented.

Alternative Semantics for Temporal Logics

A propositional modal logic of time intervals

In certain areas of artificial intelligence there is need to represent continuous change and to make statements that are interpreted with respect to time intervals rather than time points. To this

Verification of concurrent programs: a temporal proof system

TLDR
A proof system based on temporal logic is presented for proving properties of concurrent programs based on the shared-variables computation model and derived proof principles for these classes of properties obtained and lead to a compact representation of proofs.

Reasoning with Time and Chance

On the Relation of Programs and Computations to Models of Temporal Logic

  • P. Wolper
  • Philosophy, Computer Science
    Temporal Logic in Specification
  • 1987
TLDR
This paper first characterize the models and model generators of different versions of temporal logic using automata theory, then builds a classification of verification and synthesis methods that use temporal logic.

Logics and Models of Concurrent Systems

  • K. Apt
  • Computer Science
    NATO ASI Series
  • 1985
TLDR
A logic for the specification and proof of controllable processes of CCS and specification-oriented programming in TCSP and the theory of knowledge and ignorance in expert systems.
...