15-399 Constructive Logic
Lecture 24: Computation Tree Logic
We now introduce a logic for reasoning about state transitions system as
they are used in the description of concurrent systems. In this logic
we have some new judgments, such as S is a state, S may transition
to S', and A is true in state S. This leads to some new logical
connectives, so-called modal operators, that talk the truth of propositions
on sets of reachable states.
The logic we present is an intuitionistic variant of the computation tree
logic (CTL).
[ Home
| Schedule
| Assignments
| Handouts
| Software
| Overview
]
fp@cs
Frank Pfenning
|