Skip to main content
SpringerLink
Log in

Satisfiability of CTL* with Constraints

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

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

Included in the following conference series:

Abstract

We show that satisfiability for CTL* with equality-, order-, and modulo-constraints over ℤ is decidable. Previously, decidability was only known for certain fragments of CTL*, e.g., the existential and positive fragments and EF.

Omitted proofs can be found in [4]. This work is supported by the DFG Research Training Group 1763 (QuantLA). The second author is supported by the DFG research project GELO.

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. Bojańczyk, M., Toruńczyk, S.: Weak MSO+U over infinite trees. In: Proc. STACS 2012. LIPIcs, vol. 14, pp. 648–660. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2012)

    Google Scholar 

  2. Bojańczyk, M., Toruńczyk, S.: Weak MSO+U over infinite trees (long version), http://www.mimuw.edu.pl/~bojan/papers/wmsou-trees.pdf

  3. Bozzelli, L., Gascon, R.: Branching-time temporal logic extended with qualitative Presburger constraints. In: Hermann, M., Voronkov, A. (eds.) LPAR 2006. LNCS (LNAI), vol. 4246, pp. 197–211. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  4. Carapelle, C., Kartzow, A., Lohrey, M.: Satisfiability of CTL* with constraints Technical report, arXiv.org (2013), http://arxiv.org/abs/1306.0814

  5. Čerāns, K.: Deciding properties of integral relational automata. In: Shamir, E., Abiteboul, S. (eds.) ICALP 1994. LNCS, vol. 820, pp. 35–46. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  6. Colcombet, T., Löding, C.: Regular cost functions over finite trees. In: Proc. LICS 2010, pp. 70–79. IEEE Computer Society (2010)

    Google Scholar 

  7. Courcelle, B.: The monadic second-order logic of graphs V: On closing the gap between definability and recognizability. Theor. Comput. Sci. 80(2), 153–202 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  8. Demri, S., D’Souza, D.: An automata-theoretic approach to constraint LTL. Inf. Comput. 205(3), 380–415 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  9. Demri, S., Gascon, R.: Verification of qualitative ℤ constraints. Theor. Comput. Sci. 409(1), 24–40 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  10. Gascon, R.: An automata-based approach for CTL* with constraints. Electr. Notes Theor. Comput. Sci. 239, 193–211 (2009)

    Article  MathSciNet  Google Scholar 

  11. Lutz, C.: Description logics with concrete domains-a survey. In: Advances in Modal Logic 4, pp. 265–296. King’s College Publications (2003)

    Google Scholar 

  12. Lutz, C.: Combining interval-based temporal reasoning with general TBoxes. Artificial Intelligence 152(2), 235–274 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  13. Lutz, C.: NEXPTIME-complete description logics with concrete domains. ACM Trans. Comput. Log. 5(4), 669–705 (2004)

    Article  MathSciNet  Google Scholar 

  14. Lutz, C., Milicic, M.: A tableau algorithm for description logics with concrete domains and general TBoxes. J. Autom. Reasoning 38(1-3), 227–259 (2007)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Universität Leipzig, Germany

    Claudia Carapelle, Alexander Kartzow & Markus Lohrey

Authors
  1. Claudia Carapelle
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alexander Kartzow
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Markus Lohrey
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Facultad de Matemáticas, Astronomía y Física, Universidad Nacional de Córdoba – CONICET, Medina Allende s/n,, X5000HUA, Córdoba, Argentina

    Pedro R. D’Argenio

  2. Departamento de Computación,, Universidad de Buenos Aires - Conicet, Intendente Güirales 2160, C1428EGA, Ciudad Autónoma de Buenos Aires, Argentina

    Hernán Melgratti

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Carapelle, C., Kartzow, A., Lohrey, M. (2013). Satisfiability of CTL* with Constraints. In: D’Argenio, P.R., Melgratti, H. (eds) CONCUR 2013 – Concurrency Theory. CONCUR 2013. Lecture Notes in Computer Science, vol 8052. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40184-8_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-40184-8_32

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-40183-1

  • Online ISBN: 978-3-642-40184-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation