Journal of the ACM (JACM) - The MIT Press scientific computation series
The existence of refinement mappings
Theoretical Computer Science
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Knowledge and the logic of local propositions
TARK '98 Proceedings of the 7th conference on Theoretical aspects of rationality and knowledge
Branching Time Temporal Logic and Amorphous Tree Automata
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Augmenting Branching Temporal Logics with Existential Quantification over Atomic Propositions
Proceedings of the 7th International Conference on Computer Aided Verification
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
A Complete Proof Systems for QPTL
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Theoretical issues in the design and verification of distributed systems
Theoretical issues in the design and verification of distributed systems
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
A Temporal Logic of Robustness
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
On the notion of vacuous truth
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
An Epistemic Predicate CTL* for Finite Control π-Processes
Electronic Notes in Theoretical Computer Science (ENTCS)
Robust Vacuity for Branching Temporal Logic
ACM Transactions on Computational Logic (TOCL)
How thorough is thorough enough?
CHARME'05 Proceedings of the 13 IFIP WG 10.5 international conference on Correct Hardware Design and Verification Methods
Quantified CTL: expressiveness and model checking
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
| Hi-index | 0.00 |
We extend the branching temporal logics CTL and CTL* with quantified propositions and consider various semantic interpretations for the quantification. The use of quantificiation greatly increases the expressive power of the logics allowing us to represent, for example, tree-automata. We also show that some interpretations of quantification allow us to represent non-propositional properties of Kripke frames, such as the branching degree of trees. However this expressive power may also make the satisfiability problem for the logic undecidable. We give a proof of one such case, and also examine decidability in the less expressive semantics.