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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Alur, R., Dill, D.L.: A theory of timed automata. Theoretical Computer Science 126, 183–235 (1994)
Bian, J.: Efficient tableaux for temporal logic. Doctoral thesis, in preparation (2013), http://www.csse.uwa.edu.au/~jibian/thesis/thesis.pdf
Bian, J.: Linear time tableaux for partial mosaic, Online solver (2013), http://www.csse.uwa.edu.au/~jibian/partialmosaictab/
Burgess, J.: Axioms for tense logic I: ‘Since’ and ‘Until’. Notre Dame J. Formal Logic 23(2), 367–374 (1994)
Burgess, J., Gurevich, Y.: The decision problem for linear temporal logic. Notre Dame J. Formal Logic 26(2), 115–128 (1985)
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)
Kamp, H.: Tense logic and the theory of linear order. PhD thesis, University of California (1968)
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)
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)
Pnueli, A.: The temporal logic of programs. In: Proceedings of the Eighteenth Symposium on Foundations of Computer Science, pp. 46–57. Springer (1977)
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)
Reynolds, M.: The complexity of temporal logics over linear time. Journal of Studies in Logic 3, 19–50 (2010)
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)
Sistla, A., Clarke, E.: Complexity of propositional linear temporal logics. J. ACM 32, 733–749 (1985)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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)