“Sometimes” and “not never” revisited: on branching versus linear time temporal logic
Journal of the ACM (JACM) - The MIT Press scientific computation series
Improved upper and lower bounds for modal logics of programs
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
A framework for the synthesis of reactive modules
International Conference on Concurrency on Concurrency 88
Handbook of theoretical computer science (vol. B)
Tree automata, Mu-Calculus and determinacy
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
The Complexity of Tree Automata and Logics of Programs
SIAM Journal on Computing
Practical Model-Checking Using Games
TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Automata logics, and infinite games: a guide to current research
Automata logics, and infinite games: a guide to current research
Bounded model checking knowledge and branching time in synchronous multi-agent systems
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
From Nondeterministic Buchi and Streett Automata to Deterministic Parity Automata
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Complementation, Disambiguation, and Determinization of Büchi Automata Unified
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Tighter Bounds for the Determinisation of Büchi Automata
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Solving Parity Games in Practice
ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
FM '09 Proceedings of the 2nd World Congress on Formal Methods
Solving parity games in big steps
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Electronic Notes in Theoretical Computer Science (ENTCS)
ACM Transactions on Computational Logic (TOCL)
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Concurrent small progress measures
HVC'11 Proceedings of the 7th international Haifa Verification conference on Hardware and Software: verification and testing
Branching-time logics with path relativisation
Journal of Computer and System Sciences
| Hi-index | 0.00 |
We present a decision procedure for the full branching-time logic CTL* which is based on tableaux with global conditions on infinite branches. These conditions can be checked using automata-theoretic machinery. The decision procedure then consists of a doubly exponential reduction to the problem of solving a parity game. This has advantages over existing decision procedures for CTL*, in particular the automata-theoretic ones: the underlying tableaux only work on subformulas of the input formula. The relationship between the structure of such tableaux and the input formula is given by very intuitive tableau rules. Furthermore, runtime experiments with an implementation of this procedure in the MLSolver tool show the practicality of this approach within the limits of the problem's computational complexity of being 2EXPTIME-complete.