Skip to main content

An Efficient Tableau for Linear Time Temporal Logic

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 8272))

Abstract

Practical reasoning aids for dense-time temporal logics are not at all common despite a range of potential applications from verification of concurrent systems to AI. There have been recent suggestions that the temporal mosaic idea can provide implementable tableau-style decision procedures for various linear time temporal logics beyond the standard discrete natural numbers model of time. In this paper we extend the established idea of mosaic tableaux by introducing a novel abstract methodology of partiality which allows a partial mosaic to represent many mosaics. This can significantly reduce the running time of building a tableau. We present partial mosaics, partial mosaic-based tableau and algorithms for building the tableau.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alur, R., Dill, D.L.: A theory of timed automata. Theoretical Computer Science 126, 183–235 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bian, J.: Efficient tableaux for temporal logic. Doctoral thesis, in preparation (2013), http://www.csse.uwa.edu.au/~jibian/thesis/thesis.pdf

  3. Bian, J.: Linear time tableaux for partial mosaic, Online solver (2013), http://www.csse.uwa.edu.au/~jibian/partialmosaictab/

  4. Burgess, J.: Axioms for tense logic I: ‘Since’ and ‘Until’. Notre Dame J. Formal Logic 23(2), 367–374 (1994)

    MathSciNet  Google Scholar 

  5. Burgess, J., Gurevich, Y.: The decision problem for linear temporal logic. Notre Dame J. Formal Logic 26(2), 115–128 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  6. Hirsch, R., Hodkinson, I., Marx, M., Mikulas, S., Reynolds, M.: Mosaics and step-by-step. Remarks on “A modal logic of relations”. In: Orlowska, E. (ed.) Logic at Work: Essays Dedicated to the Memory of Helen Rasiowa. STUDFUZZ, vol. 24, pp. 158–167. Springer, Heidelberg (1999)

    Google Scholar 

  7. Kamp, H.: Tense logic and the theory of linear order. PhD thesis, University of California (1968)

    Google Scholar 

  8. Kesten, Y., Manna, Z., Pnueli, A.: Temporal verification of simulation and refinement. In: de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.) REX 1993. LNCS, vol. 803, pp. 273–346. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  9. Marx, M., Mikulas, S., Reynolds, M.: The mosaic method for temporal logics. In: Dyckhoff, R. (ed.) TABLEAUX 2000. LNCS (LNAI), vol. 1847, pp. 324–340. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  10. Pnueli, A.: The temporal logic of programs. In: Proceedings of the Eighteenth Symposium on Foundations of Computer Science, pp. 46–57. Springer (1977)

    Google Scholar 

  11. Reynolds, M.: Dense time reasoning via mosaics. In: TIME 2009: Proceedings of the 2009 16th International Symposium on Temporal Representation and Reasoning, pp. 3–10. IEEE Computer Society (2009)

    Google Scholar 

  12. Reynolds, M.: The complexity of temporal logics over linear time. Journal of Studies in Logic 3, 19–50 (2010)

    Google Scholar 

  13. Reynolds, M.: A tableau for until and since over linear time. In: Proc. of 18th International Symposium on Temporal Representation and Reasoning (TIME 2011), Lubeck, Germany. IEEE Computer Society Press (September 2011)

    Google Scholar 

  14. Sistla, A., Clarke, E.: Complexity of propositional linear temporal logics. J. ACM 32, 733–749 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  15. Yin, Z., Tambe, M.: Continuous time planning for multiagent teams with temporal constraints. In: Proceedings of the 22nd International Joint Conference on Artificial Intelligence, IJCAI 2011, pp. 465–471 (2011)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer International Publishing Switzerland

About this paper

Cite this paper

Bian, J., French, T., Reynolds, M. (2013). An Efficient Tableau for Linear Time Temporal Logic. In: Cranefield, S., Nayak, A. (eds) AI 2013: Advances in Artificial Intelligence. AI 2013. Lecture Notes in Computer Science(), vol 8272. Springer, Cham. https://doi.org/10.1007/978-3-319-03680-9_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-03680-9_31

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-03679-3

  • Online ISBN: 978-3-319-03680-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics