Skip to main content
SpringerLink
Log in

On Solving Temporal Logic Queries

  • Conference paper
  • First Online:
Algebraic Methodology and Software Technology (AMAST 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2422))

Abstract

Temporal query checking is an extension of temporal model checking where one asks what propositional formulae can be inserted in a temporal query (a temporal formula with a placeholder) so that the resulting formula is satisfied in the model at hand.

We study the problem of computing all minimal solutions to a temporal query without restricting to so-called “valid” queries (queries guaranteed to have a unique minimal solution). While this problem is intractable in general, we show that deciding uniqueness of the minimal solution (and computing it) can be done in polynomial-time.

Now at Lab. GRAVIR, INRIA Rhône-Alpes, Montbonnot, France. Email: Samuel.Hornus@inria.fr. The research described in this paper was conducted while S. Hornus was at LSV.

When the system does not satisfy the temporal formula, most model checkers provide a diagnostic, e.g. as a trace showing one possible way of violating the property.

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. B. Bérard, M. Bidoit, A. Finkel, F. Laroussinie, A. Petit, L. Petrucci, and Ph. Schnoebelen. Systems and Software Verification. Model-Checking Techniques and Tools. Springer, 2001.

    Google Scholar 

  2. G. Bruns and P. Godefroid. Temporal logic query checking (extended abstract). In Proc. 16th IEEE Symp. Logic in Computer Science (LICS’2001), Boston, MA, USA, June 2001, pages 409–417. IEEE Comp. Soc. Press, 2001.

    Google Scholar 

  3. R. E. Bryant. Symbolic boolean manipulation with ordered binary-decision diagrams. ACM Computing Surveys, 24(3):293–318, 1992.

    Article  Google Scholar 

  4. E. M. Clarke, O. Grumberg, and D. A. Peled. Model Checking. MIT Press, 1999.

    Google Scholar 

  5. W. Chan. Temporal-logic queries. In Proc. 12th Int. Conf. Computer Aided Verification (CAV’2000), Chicago, IL, USA, July 2000, volume 1855 of Lecture Notes in Computer Science, pages 450–463. Springer, 2000.

    Google Scholar 

  6. R. Cleaveland and B. Steffen. A linear-time model-checking algorithm for the alternation-free modal mu-calculus. In Proc. 3rd Int. Workshop Computer Aided Verification (CAV’91), Aalborg, Denmark, July 1991, volume 575 of Lecture Notes in Computer Science, pages 48–58. Springer, 1992.

    Google Scholar 

  7. E. A. Emerson. Temporal and modal logic. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, vol. B, chapter 16, pages 995–1072. Elsevier Science, 1990.

    Google Scholar 

  8. O. Kupferman and O. Grumberg. Buy one, get one free!!! Journal of Logic and Computation, 6(4):523–539, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  9. F. Laroussinie, N. Markey, and Ph. Schnoebelen. On model checking durational Kripke structures (extended abstract). In Proc. 5th Int. Conf. Foundations of Software Science and Computation Structures (FOSSACS’2002), Grenoble, France, Apr. 2002, volume 2303 of Lecture Notes in Computer Science, pages 264–279. Springer, 2002.

    Google Scholar 

  10. F. Laroussinie, Ph. Schnoebelen, and M. Turuani. On the expressivity and complexity of quantitative branching-time temporal logics. In Proc. 4th Latin American Symposium on Theoretical Informatics (LATIN’2000), Punta del Este, Uruguay, Apr. 2000, volume 1776 of Lecture Notes in Computer Science, pages 437–446. Springer, 2000.

    Google Scholar 

  11. C. H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.

    Google Scholar 

  12. A. C. Patthak, I. Bhattacharya, A. Dasgupta, P. Dasgupta, and P. P. Chakrabarti. Quantified Computation Tree Logic. Information Processing Letters, 82(3):123–129, 2002.

    Article  MATH  MathSciNet  Google Scholar 

  13. A. Pnueli. The temporal logic of programs. In Proc. 18th IEEE Symp. Foundations of Computer Science (FOCS’77), Providence, RI, USA, Oct.–Nov. 1977, pages 46–57, 1977.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Lab. Spécification & Vérification, ENS de Cachan & CNRS UMR 8643, 61, av. Pdt. Wilson, 94235, Cachan Cedex, France

    Samuel Hornus & Philippe Schnoebelen

Authors
  1. Samuel Hornus
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Philippe Schnoebelen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. LORIA - CNRS & INRIA, Campus Scientifique, Bâtiment LORIA, BP 239, 54506, Vandoeuvre-lès-Nancy, France

    Hélène Kirchner

  2. LORIA - INRIA, 615, rue du Jardin Botanique, 54602, Villers-lès-Nancy, France

    Christophe Ringeissen

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hornus, S., Schnoebelen, P. (2002). On Solving Temporal Logic Queries. In: Kirchner, H., Ringeissen, C. (eds) Algebraic Methodology and Software Technology. AMAST 2002. Lecture Notes in Computer Science, vol 2422. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45719-4_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-45719-4_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44144-1

  • Online ISBN: 978-3-540-45719-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation