Towards a CTL* tableau

Authors:
Mark Reynolds
Affiliations:
The University of Western Australia, Perth, Australia
Venue:
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Year:
2005

Citing 12
Cited 2

Decision procedures and expressiveness in the temporal logic of branching time

Journal of Computer and System Sciences
Improved upper and lower bounds for modal logics of programs

STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Temporal and modal logic

Handbook of theoretical computer science (vol. B)
Modal and temporal logics

Handbook of logic in computer science (vol. 2)
Automatic verification of finite state concurrent system using temporal logic specifications: a practical approach

POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Decidable and Undecidable Fragments of First-Order Branching Temporal Logics

LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
A New One-Pass Tableau Calculus for PLTL

TABLEAUX '98 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
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
The temporal logic of programs

SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
The complexity of tree automata and logics of programs

SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
An axiomatization of PCTL*

Information and Computation

CTL-RP: A computation tree logic resolution prover

AI Communications - Practical Aspects of Automated Reasoning
One-pass tableaux for computation tree logic

LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a sound, complete and relatively straightforward tableau method for deciding valid formulas in the propositional version of the bundled (or suffix and fusion closed) computation tree logic BCTL*. This proves that BCTL* is decidable. It is also moderately useful to have a tableau available for a reasonably expressive branching time temporal logic. However, the main interest in this should be that it leads us closer to being able to devise a tableau-based technique for theorem-proving in the important full computational tree logic CTL*.