Theoretical Computer Science
Decidability of Quantifed Propositional Branching Time Logics
AI '01 Proceedings of the 14th Australian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
An Automata-Theoretic Completeness Proof for Interval Temporal Logic
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Compositional Reasoning Using Interval Temporal Logic and Tempura
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
Handbook of automated reasoning
A Complete Axiomatization of Interval Temporal Logic with Infinite Time
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
ACM Transactions on Computational Logic (TOCL)
Axiomatizing extended temporal logic fragments via instantiation
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
On the expressive power of QLTL
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
Quantified CTL: expressiveness and model checking
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
A complete proof system for propositional projection temporal logic
Theoretical Computer Science
| Hi-index | 0.00 |
The paper presents an axiomatic system for \emm{quantified propositional temporal logic} (\qptl), which is propositional temporal logic equipped with quantification over propositions (boolean variables). The advantages of this extended temporal logic is that its expressive power is strictly higher than that of the un-quantified version (\ptl) and is equal to that of S1S, as well as that of \omega-automata. Another important application of \qptl\ is its use for formulating and verifying refinement relations between reactive systems. In fact, the completeness proof is based on the reduction of a \qptl\ formula into a \buchi\ automaton, and performing equivalence transformations on this automata, formally justifying these transformations.