Decidability, Completeness, and Extensions of Linear Temporal Logic [PhD Thesis]
โ Scribed by Lichtenstein O.
- Year
- 1991
- Tongue
- English
- Leaves
- 256
- Category
- Library
No coin nor oath required. For personal study only.
โฆ Synopsis
This thesis was carried out under the supervision of Prof. A. Pnueli.
This research deals with decidability, completeness, and extensions of linear
time temporal logic. These properties are examined first for a general class
of models, that are not restricted to the execution of a specific program
(general validity), and then considered for a class of models representing
computations of a given program (validity over program).
The research contains three main parts: the first deals with Propositional Temporal Logic (PTL), the second deals with mu-Temporal Logic
(muTL), which is PTL augmented by fixpoint operators, and the third part
investigates XCTL which is a version of temporal logic that explicitly refers
to a running clock, in order to specify real time properties of reactive
programs.
๐ SIMILAR VOLUMES
This dissertation is about extending modal logic. It tells you what a system of extended modal logic is, it gives you three case studies of systems of modal logic, and it gives you very general approaches to two important themes in modal logic.
This dissertation is about extending modal logic. It tells you what a system of extended modal logic is, it gives you three case studies of systems of modal logic, and it gives you very general approaches to two important themes in modal logic.
This is a doctoral dissertation of Edith Spaan under the supervision of prof. Johan van Benthem.
This is a doctoral dissertation of Edith Spaan under the supervision of prof. Johan van Benthem.