Abstract
We address the problem of model checking temporal formulas with Until and Since over general linear time. General linear time allows us to go beyond discrete natural numbers time and consider temporal models with continuous properties for applications such as distributed systems and message passing, and to even more unrestricted contexts thrown up by natural language semantics and AI modelling of human reasoning. We use a recently formalised compositional language that is capable of describing models of any satisfiable formula. Given a model described in this model expression language and a temporal logic formula, the algorithm decides whether the formula is satisfied in the model. As for standard natural-numbers time model checkers, the computational time required by the algorithm is linear in the size of the model expression. We illustrate this result briefly with some examples including a system that needs to interact with a environment exhibiting Zeno behaviours.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alur, R., Courcoubetis, C., Dill, D.L.: Model-checking for real-time systems. In: LICS 1990, pp. 414–425. IEEE Computer Society (1990)
Alur, R., Dill, D.L.: Automata for modeling real-time systems. In: Paterson, M. (ed.) ICALP 1990. LNCS, vol. 443, pp. 322–335. Springer, Heidelberg (1990)
Burgess, J.P., Gurevich, Y.: The decision problem for linear temporal logic. Notre Dame J. Formal Logic 26(2), 115–128 (1985)
French, T., McCabe-Dansted, J.C., Reynolds, M.: Synthesis for temporal logic over the reals. In: Bolander, T., Braüner, T., Ghilardi, S., Moss, L.S. (eds.) Advances in Modal Logic 2012, pp. 217–238. College Publications (2012)
French, T., McCabe-Dansted, J., Reynolds, M.: Indiscrete models: Model building and model checking over linear time. In: Lodaya, K. (ed.) ICLA 2013. LNCS, vol. 7750, pp. 50–68. Springer, Heidelberg (2013)
French, T., McCabe-Dansted, J.C., Reynolds, M.: Complexity of model checking general linear time. In: TIME 2013 (accepted, to appear, 2013)
French, T., McCabe-Dansted, J.C., Reynolds, M.: Model checking for compositional models of general linear time: Long version. Tech. rep., CSSE, UWA (Dec 2012), http://www.csse.uwa.edu.au/~john/papers/ModelCheckZeno_tech.pdf
Gabbay, D., Hodkinson, I., Reynolds, M.: Temporal Logic: Mathematical Foundations and Computational Aspects, vol. 1. Oxford University Press (1994)
Gabbay, D.M., Hodkinson, I.M., Reynolds, M.A.: Temporal expressive completeness in the presence of gaps. In: Oikkonen, J., Väänänen, J. (eds.) Logic Colloquium 1990, Proceedings ASL European Meeting 1990, Helsinki. Lecture Notes in Logic, vol. 2, pp. 89–121. Springer (1993)
Gabbay, D.M., Pnueli, A., Shelah, S., Stavi, J.: On the temporal analysis of fairness. In: 7th ACM Symp. on Princ. of Prog. Languages, Las Vegas, pp. 163–173 (1980)
Hugett, N.: Zeno’s paradoxes: 3.2 achilles and the tortoise. In: Zalta, E. (ed.) Stanford Encyclopedia of Philosophy. Chapman and Hall, Boca Raton (2010)
Kamp, H.: Tense logic and the theory of linear order. Ph.D., UCLA (1968)
Läuchli, H., Leonard, J.: On the elementary theory of linear order. Fundamenta Mathematicae 59, 109–116 (1966)
Mosterman, P.: 15.6 pathological behaviour classes, hybrid dynamic systems: Modeling and execution. In: Fishwick, P. (ed.) Handbook of Dynamic System Modelling, ch. 15, pp. 15–22 to 15–23. Chapman and Hall, Boca Raton (2007)
McCabe-Dansted, J.C.: Model checker for general linear time (online applet and data) (2012), http://www.csse.uwa.edu.au/~mark/research/Online/mechecker.html
Pnueli, A.: The temporal logic of programs. In: Proceedings of the 18th Symposium on Foundations of Computer Science, Providence, RI, pp. 46–57 (1977)
Reynolds, M.: The complexity of the temporal logic over the reals. Annals of Pure and Applied Logic 161(8), 1063–1096 (2010), doi:10.1016/j.apal.2010.01.002
Reynolds, M.: Continuous temporal models. In: Stumptner, M., Corbett, D., Brooks, M. (eds.) AI 2001. LNCS (LNAI), vol. 2256, pp. 414–425. Springer, Heidelberg (2001)
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, Washington, DC (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: Combi, C., Leucker, M., Wolter, F. (eds.) TIME, pp. 41–48. IEEE (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
French, T., McCabe-Dansted, J., Reynolds, M. (2013). Model Checking General Linear Temporal Logic. In: Galmiche, D., Larchey-Wendling, D. (eds) Automated Reasoning with Analytic Tableaux and Related Methods. TABLEAUX 2013. Lecture Notes in Computer Science(), vol 8123. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40537-2_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-40537-2_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40536-5
Online ISBN: 978-3-642-40537-2
eBook Packages: Computer ScienceComputer Science (R0)