Propositional temporal logic is not suitable for expressing properties on the evolution of dynamically allocated entities over time. In particular, it is not possible to trace such entities through computation steps, since this requires the ability to freely mix quantification and temporal operators.
In this paper we study Quantified Computation Tree Logic (QCTL), which extends the well-known propositional computation tree logic, PCTL, with first and (monadic) second order quantification. The semantics of QCTL is expressed on algebra automata, which are automata enriched with abstract algebras at each state, and with reallocations at each transition that express an injective renaming of the algebra elements from one state to the next. The reallocations enable minimization of the automata modulo bisimilarity, essentially through symmetry reduction. Our main result is to show that each combination of a QCTL formula and a finite algebra automaton can be transformed to an equivalent PCTL formula over an ordinary Kripke structure, while maintaining the symmetry reduction. The transformation is structure-preserving on the formulae. This gives rise to a method to lift any model checking technique for PCTL to QCTL.
|Title of host publication||CONCUR 2006 – Concurrency Theory|
|Subtitle of host publication||17th International Conference, CONCUR 2006, Bonn, Germany, August 27-30, 2006. Proceedings|
|Editors||Christel Baier, Holger Hermanns|
|Place of Publication||Berlin, Heidelberg|
|Number of pages||16|
|Publication status||Published - 2006|
|Event||17th International Conference on Concurrency Theory, CONCUR 2006 - Bonn, Germany|
Duration: 27 Aug 2006 → 30 Aug 2006
Conference number: 17
|Name||Lecture Notes in Computer Science|
|Conference||17th International Conference on Concurrency Theory, CONCUR 2006|
|Period||27/08/06 → 30/08/06|