Skip to main content
SpringerLink
Log in

Quantified CTL: Expressiveness and Model Checking

(Extended Abstract)

  • Conference paper
CONCUR 2012 – Concurrency Theory (CONCUR 2012)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7454))

Included in the following conference series:

Abstract

While it was defined long ago, the extension of CTL with quantification over atomic propositions has never been studied extensively. Considering two different semantics (depending whether propositional quantification refers to the Kripke structure or to its unwinding tree), we study its expressiveness (showing in particular that QCTL coincides with Monadic Second-Order Logic for both semantics) and characterize the complexity of its model-checking problem, depending on the number of nested propositional quantifiers (showing that the structure semantics populates the polynomial hierarchy while the tree semantics populates the exponential hierarchy). We also show how these results apply to model checking ATL-like temporal logics for games.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alur, R., Henzinger, T.A., Kupferman, O.: Alternating-time temporal logic. J. ACM 49(5), 672–713 (2002)

    MathSciNet  Google Scholar 

  2. Brihaye, T., Da Costa, A., Laroussinie, F., Markey, N.: ATL with Strategy Contexts and Bounded Memory. In: Artemov, S., Nerode, A. (eds.) LFCS 2009. LNCS, vol. 5407, pp. 92–106. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  3. Bruns, G., Godefroid, P.: Model Checking Partial State Spaces with 3-Valued Temporal Logics. In: Halbwachs, N., Peled, D.A. (eds.) CAV 1999. LNCS, vol. 1633, pp. 274–287. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  4. Chatterjee, K., Henzinger, T.A., Piterman, N.: Strategy Logic. In: Caires, L., Vasconcelos, V.T. (eds.) CONCUR 2007. LNCS, vol. 4703, pp. 59–73. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  5. Clarke, E.M., Emerson, E.A.: Design and Synthesis of Synchronization Skeletons using Branching-Time Temporal Logic. In: Kozen, D. (ed.) Logic of Programs 1981. LNCS, vol. 131, pp. 52–71. Springer, Heidelberg (1982)

    Chapter  Google Scholar 

  6. Courcelle, B., Engelfriet, J.: Graph Structure and Monadic Second-Order Logic, a Language Theoretic Approach. Cambridge University Press (2011)

    Google Scholar 

  7. Da Costa, A., Laroussinie, F., Markey, N.: ATL with strategy contexts: Expressiveness and model checking. In: FSTTCS 2010. LIPIcs, vol. 8, pp. 120–132. LZI (2010)

    Google Scholar 

  8. Da Costa, A., Laroussinie, F., Markey, N.: Quantified CTL: expressiveness and model checking. Research Report LSV-12-02, Laboratoire Spécification et Vérification, ENS Cachan, France (2012)

    Google Scholar 

  9. Ebbinghaus, H.-D., Flum, J.: Finite Model Theory. Springer (1995)

    Google Scholar 

  10. Emerson, E.A., Halpern, J.Y.: “Sometimes” and “not never” revisited: On branching versus linear time temporal logic. J. ACM 33(1), 151–178 (1986)

    MathSciNet  MATH  Google Scholar 

  11. Emerson, E.A., Sistla, A.P.: Deciding full branching time logic. Inf.& Cont. 61(3), 175–201 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  12. French, T.: Decidability of Quantifed Propositional Branching Time Logics. In: Stumptner, M., Corbett, D.R., Brooks, M. (eds.) AI 2001. LNCS (LNAI), vol. 2256, pp. 165–176. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  13. Gottlob, G.: NP trees and Carnap’s modal logic. J. ACM 42(2), 421–457 (1995)

    MathSciNet  MATH  Google Scholar 

  14. Kesten, Y., Pnueli, A.: A complete proof systems for QPTL. In: LICS 1995, pp. 2–12. IEEE Comp. Soc. Press (1995)

    Google Scholar 

  15. Kupferman, O.: Augmenting Branching Temporal Logics with Existential Quantification over Atomic Propositions. In: Wolper, P. (ed.) CAV 1995. LNCS, vol. 939, pp. 325–338. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  16. Kupferman, O., Madhusudan, P., Thiagarajan, P.S., Vardi, M.Y.: Open Systems in Reactive Environments: Control and Synthesis. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol. 1877, pp. 92–107. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  17. Kupferman, O., Vardi, M.Y.: Weak alternating automata and tree automata emptiness. In: STOC 1998, pp. 224–233. ACM Press (1998)

    Google Scholar 

  18. Kupferman, O., Vardi, M.Y., Wolper, P.: An automata-theoretic approach to branching-time model-checking. J. ACM 47(2), 312–360 (2000)

    MathSciNet  MATH  Google Scholar 

  19. Mogavero, F., Murano, A., Vardi, M.Y.: Reasoning about strategies. In: FSTTCS 2010. LIPIcs, vol. 8, pp. 133–144. LZI (2010)

    Google Scholar 

  20. Moller, F., Rabinovich, A.: Counting on CTL*: on the expressive power of monadic path logic. Inf.& Comp. 184(1), 147–159 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  21. Muller, D.E., Schupp, P.E.: Alternating automata on infinite trees. TCS 54(2-3), 267–276 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  22. Muller, D.E., Schupp, P.E.: Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra. TCS 141(1-2), 69–107 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  23. Patthak, A.C., Bhattacharya, I., Dasgupta, A., Dasgupta, P., Chakrabarti, P.P.: Quantified computation tree logic. IPL 82(3), 123–129 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  24. Pinchinat, S.: A Generic Constructive Solution for Concurrent Games with Expressive Constraints on Strategies. In: Namjoshi, K.S., Yoneda, T., Higashino, T., Okamura, Y. (eds.) ATVA 2007. LNCS, vol. 4762, pp. 253–267. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  25. Pnueli, A.: The temporal logic of programs. In: FOCS 1977, pp. 46–57. IEEE Comp. Soc. Press (1977)

    Google Scholar 

  26. Queille, J.-P., Sifakis, J.: Specification and Verification of Concurrent Systems in CESAR. In: Dezani-Ciancaglini, M., Montanari, U. (eds.) Programming 1982. LNCS, vol. 137, pp. 337–351. Springer, Heidelberg (1982)

    Chapter  Google Scholar 

  27. Riedweg, S., Pinchinat, S.: Quantified Mu-Calculus for Control Synthesis. In: Rovan, B., Vojtáš, P. (eds.) MFCS 2003. LNCS, vol. 2747, pp. 642–651. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  28. Sistla, A.P.: Theoretical Issues in the Design and Verification of Distributed Systems. PhD thesis, Harvard University, Cambridge, Massachussets, USA (1983)

    Google Scholar 

  29. Sistla, A.P., Vardi, M.Y., Wolper, P.: The complementation problem for Büchi automata with applications to temporal logics. TCS 49, 217–237 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  30. Thomas, W.: Languages, automata and logics. In: Handbook of Formal Languages, pp. 389–455. Springer (1997)

    Google Scholar 

  31. Vardi, M.Y.: The complexity of relational query languages. In: STOC 1982, pp. 137–146. ACM Press (1982)

    Google Scholar 

  32. Wang, F., Huang, C.-H., Yu, F.: A Temporal Logic for the Interaction of Strategies. In: Katoen, J.-P., König, B. (eds.) CONCUR 2011. LNCS, vol. 6901, pp. 466–481. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LSV – CNRS & ENS Cachan, France

    Arnaud Da Costa & Nicolas Markey

  2. LIAFA – Univ. Paris Diderot & CNRS, France

    François Laroussinie

Authors
  1. Arnaud Da Costa
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. François Laroussinie
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Nicolas Markey
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computing Science, Newcastle University, Claremont Tower, Claremont Road, NE1 7RU, Newcastle upon Tyne, UK

    Maciej Koutny

  2. Department of Computer Science, University of Leicester, Computer Science Building, University Road, LE1 7RH, Leicester, UK

    Irek Ulidowski

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Da Costa, A., Laroussinie, F., Markey, N. (2012). Quantified CTL: Expressiveness and Model Checking. In: Koutny, M., Ulidowski, I. (eds) CONCUR 2012 – Concurrency Theory. CONCUR 2012. Lecture Notes in Computer Science, vol 7454. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32940-1_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-32940-1_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-32939-5

  • Online ISBN: 978-3-642-32940-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation