Characterizing Kripke structures in temporal logic. Interim report
The question of whether branching-time temporal logic or linear-time temporal logic is best for reasoning about concurrent programs is one of the most-controversial issues in logics of programs. Concurrent programs are usually modeled by labelled state-transition graphs in which some state is designated as the initial state. For historical reasons such graphs are called Kripke structures. In linear temporal logic, operators are provided for describing events along a single time path (i.e., along a single path in a Kripke structure). In a branching-time logic, the temporal operators quantify over the futures that are possible from a given state (i.e., over the possible paths that lead from a state). It is well known that the two types of temporal logic have different expressive powers. Linear temporal logic, for example, can express certain fairness properties that cannot be expressed in branching-time temporal logic. On the other hand, certain practical decision problems like model checking are easier for branching-time temporal logic than for linear temporal logic. This paper provides further insight on which type of logic is best. It is shown that if two finite Kripke structures can be distinguished by some formula that contains both branching-time and linear-time operators, then the structures can be distinguished by a formula that contains only branching-time operators. Specifically, it is shown that if two finite Kripke structures can be distinguished by some formula of the logic CTL (i.e., if there is some CTL formula that is true in one but not in the other), then they can be distinguished by some formula of the logic CTL.
- Research Organization:
- Carnegie-Mellon Univ., Pittsburgh, PA (USA). Dept. of Computer Science
- OSTI ID:
- 5263448
- Report Number(s):
- AD-A-188620/9/XAB; CMU-CS-87-104
- Country of Publication:
- United States
- Language:
- English
Similar Records
Is the interesting part of process logic uninteresting. : A translation from PL to PDL
Some graph theoretic issues in VLSI design