Alternating automata on infinite trees
Theoretical Computer Science
Handbook of theoretical computer science (vol. B)
Handbook of logic in computer science (vol. 2)
Automated temporal reasoning about reactive systems
Proceedings of the VIII Banff Higher order workshop conference on Logics for concurrency : structure versus automata: structure versus automata
An automata-theoretic approach to linear temporal logic
Proceedings of the VIII Banff Higher order workshop conference on Logics for concurrency : structure versus automata: structure versus automata
Branching Time Temporal Logic and Amorphous Tree Automata
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
An Automata-Theoretic Approach to Branching-Time Model Checking (Extended Abstract)
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
Axiomatising Extended Computation Tree Logic
CAAP '96 Proceedings of the 21st International Colloquium on Trees in Algebra and Programming
Search Strategies for Resolution in Temporal Logics
CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
A resolution method for temporal logic
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
| Hi-index | 0.00 |
In this paper we consider proof techniques for branching-time temporal logics. While a considerable amount of research heis been carried out regarding the relationship between finite automata and such logics, practical proof techniques for such logics have received relatively little attention. Recently, however, several applications requiring refined proof methods for branching-time temporal logics have appeared, most notably the specification and verification of multi-agent systems. Thus, here we extend our clausal resolution method for linear-time temporal logics to a branching-time framework, in particular to the powerful CTL* logic. The key elements of the resolution method, namely the normal form, the concept of step resolution and a novel temporal resolution rule, Eire introduced, justified, and applied.