The relative completeness of a version of CTL

Authors:
Hidetomo Machi;Kohji Tomita;Chiharu Hosono
Affiliations:
University of Tsukuba, Japan;National Institute of Advanced Industrial Science and Technology (AIST), Japan;University of Tsukuba, Japan
Venue:
CATS '05 Proceedings of the 2005 Australasian symposium on Theory of computing - Volume 41
Year:
2005

Citing 7
Cited 0

“Sometimes” and “not never” revisited: on branching versus linear time temporal logic

Journal of the ACM (JACM) - The MIT Press scientific computation series
Automatic verification of finite-state concurrent systems using temporal logic specifications

ACM Transactions on Programming Languages and Systems (TOPLAS)
Completing the temporal picture

Selected papers of the 16th international colloquium on Automata, languages, and programming
Temporal and modal logic

Handbook of theoretical computer science (vol. B)
Model Checking and Transitive-Closure Logic

CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic

Logic of Programs, Workshop
A Deductive Proof System for CTL

CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show the relative completeness of a version of CTL* over possibly infinite states. It is based on a fair discrete system, which is with strong and weak fairness. Validity of a CTL* formula is reduced to the validity of an assertion by eliminating the temporal operators and path quantifiers inductively. The idea is to represent the predicate describing that "a fair path begins with the current state" in the underlying assertion language using fixpoint operators.