This course is an introduction to temporal logics in computer science, and in particular to systems and approaches used for specification and verification of properties of concurrent and reactive systems. We will begin with a brief journey through classical temporal logic, en route to the core of the course: temporal logics of computations, where we will introduce the basic systems of linear and branching time logics and mu-calculus, and will discuss their semantics, expressiveness, axiomatizations, complexity, comparisons with each other, and relationships with automata which provide efficient decision procedures and methods for model checking. This is an introductory course. You will be expected to know just a little, and that would include a good grasp of propositional logic and a familiarity with the basics of first-order logic. Some exposure to modal logic would make it easier to understand how temporal logics work, and your experience with computing will provide you with the basic intuition on computations and will help you make good sense of its formal models. If you have some knowledge on formal verification and on complexity, this would be an advantage. If you do not quite know all these, do not give up. Even if you are not able to digest all
|
996
|
Automatic verification of finite-state concurrent systems using temporal logic specifications
– Clarke, Emerson, et al.
- 1986
|
|
909
|
Temporal and modal logic
– Emerson
- 1990
|
|
723
|
Symbolic Boolean manipulation with ordered binary-decision diagrams
– Bryant
- 1992
|
|
682
|
Towards a general theory of action and time
– Allen
- 1984
|
|
356
|
Symbolic Model Checking: 1020 States and Beyond
– Burch, Clarke, et al.
- 1990
|
|
257
|
A calculus of duration
– Chaochen, Hoare, et al.
- 1991
|
|
247
|
Automatic Verification of Finite State Concurrent Systems Using Temporal Logic Specifications
– Clarke, Emerson, et al.
- 1986
|
|
182
|
Efficient model checking in fragments of the propositional mu-calculus
– Emerson, Lei
- 1986
|
|
155
|
Tree automata, mu-calculus and determinacy (Extended abstract
– Emerson, Jutla
- 1991
|
|
148
|
Correspondence theory
– Benthem
- 1984
|
|
143
|
Sometimes” and “Not Never” revisited: on branching versus linear time temporal logic
– Emerson, Clarke
- 1986
|
|
131
|
The temnporal logic of branching time
– Ben-Ari, Manna, et al.
- 1983
|
|
104
|
The Logic of Time
– Benthem
- 1983
|
|
103
|
Two-dimensional modal logic
– Segerberg
- 1973
|
|
96
|
Decision procedures and expressiveness in the temporal logic of branching time
– Emerson, Halpern
- 1982
|
|
89
|
Hybrid languages
– Blackburn, Seligman
- 1995
|
|
77
|
Hybrid logics: characterization, interpolation and complexity
– Areces, Blackburn, et al.
- 2001
|
|
73
|
Axioms for tense logic I
– Burgess
- 1982
|
|
72
|
Internalizing labelled deduction
– Blackburn
|
|
69
|
Modal logic with names
– Gargov, Goranko
- 1993
|
|
66
|
The Declarative Past and Imperative Future: Executable Temporal Logic for Interactive Systems
– Gabbay
- 1987
|
|
63
|
Symbolic model checking for probabilistic processes
– Baier, Clarke, et al.
- 1997
|
|
60
|
Adding a temporal dimension to a logic system
– Finger, Gabbay
- 1992
|
|
47
|
The modal logic of inequality
– Rijke
- 1992
|
|
42
|
Nominal Tense Logic’, Notre Dame
– Blackburn
- 1992
|
|
39
|
Deciding full branching time logics
– Emerson, Sistla
- 1984
|
|
37
|
Design and synthesis of synchronisation skeletons using branching time temporal logic
– Clarke, Emerson
- 1981
|
|
33
|
Hybrid languages and temporal logic
– Blackburn, Tzakova
- 1999
|
|
32
|
The modal mu-calculus alternation hierarchy is strict
– Bradfield
- 1996
|
|
24
|
METATEM: An introduction
– Barringer, Fisher, et al.
- 1995
|
|
22
|
Logic and time
– Burgess
- 1979
|
|
22
|
Logics of Time and
– Goldblatt
- 1987
|
|
17
|
Alternative semantics for temporal logics
– Emerson
- 1983
|
|
14
|
Mathematical Logic for Computer Science
– Ben-Ari
- 1993
|
|
12
|
Modal logic of concurrent nondeterministic programs
– Abrahamson
- 1979
|
|
10
|
CTL ∗ and ECTL ∗ as fragments of the modal µ-calculus
– Dam
- 1994
|
|
7
|
An axiomatization of the temporal logic with Since and Until over the real numbers
– Gabbay, Hodkinson
- 1990
|
|
4
|
An extended branching-time Ockhamist temporal logic
– Brown, Goranko
- 1999
|
|
4
|
Axioms for tense logic I: “Since” and “Until
– Burgess
- 1982
|
|
4
|
Temporal Logic, Automata and Classical Theories: an Introduction
– Dam
- 1994
|
|
1
|
Effective firstorder temporal logics of programs
– Andreka, Goranko, et al.
- 1995
|
|
1
|
Duality and the completeness of the modal µ-calculus
– Ambler, Kwiatkowska, et al.
- 1995
|
