Abstract
We present a satisfiability-preserving translation of QTL formulae with counting modalities interpreted over finitely variable signals into formulae of the CLTL-over-clocks logic. The satisfiability of CLTL-over-clocks can be solved through a suitable encoding into the input logics of SMT solvers, so our translation constitutes an effective decision procedure for QTL with counting modalities. It is known that counting modalities increase the expressiveness of QTL (hence also of the expressively equivalent MITL logic); to the best of our knowledge, our decision procedure for such modalities is the first actually implemented.
Work supported by the Programme IDEAS-ERC, Project 227977-SMScom, and by PRIN Project 2010LYA9RH-006.
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
qtlsolver, http://qtlsolver.googlecode.com
Zot: a bounded satisfiability checker, http://zot.googlecode.com
Alur, R., Dill, D.L.: A theory of timed automata. Theoretical Computer Science 126(2), 183–235 (1994)
Alur, R., Feder, T., Henzinger, T.A.: The benefits of relaxing punctuality. Journal of the ACM 43(1), 116–146 (1996)
Baier, C., Katoen, J.-P.: Principles of Model Checking. MIT Press (2008)
Bersani, M.M., Frigeri, A., Rossi, M., San Pietro, P.: Completeness of the bounded satisfiability problem for constraint LTL. In: Delzanno, G., Potapov, I. (eds.) RP 2011. LNCS, vol. 6945, pp. 58–71. Springer, Heidelberg (2011)
Bersani, M.M., Rossi, M., San Pietro, P.: On the satisfiability of metric temporal logics over the reals. In: Proceedings of AVOCS (2013)
Bersani, M.M., Rossi, M., San Pietro, P.: A tool for deciding the satisfiability of continuous-time metric temporal logic. In: Proceedings of TIME (2013)
Demri, S., D’Souza, D.: An automata-theoretic approach to constraint LTL. Inf. Comput. 205(3), 380–415 (2007)
Furia, C.A., Mandrioli, D., Morzenti, A., Rossi, M.: Modeling Time in Computing. EATCS Monographs in Theoretical Computer Science. Springer (2012)
Hirshfeld, Y., Rabinovich, A.: Timer formulas and decidable metric temporal logic. Information and Computation 198(2), 148–178 (2005)
Hirshfeld, Y., Rabinovich, A.: Expressiveness of metric modalities for continuous time. Logical Methods in Computer Science 3(1:3), 1–11 (2007)
Hirshfeld, Y., Rabinovich, A.: Continuous time temporal logic with counting. Information and Computation 214, 1–9 (2012)
Maler, O., Nickovic, D., Pnueli, A.: From MITL to timed automata. In: Asarin, E., Bouyer, P. (eds.) FORMATS 2006. LNCS, vol. 4202, pp. 274–289. Springer, Heidelberg (2006)
Microsoft Research. Z3: An efficient SMT solver
Morzenti, A., San Pietro, P.: Object-oriented logical specification of time-critical systems. ACM TOSEM 3(1), 56–98 (1994)
Rabinovich, A.: Complexity of metric temporal logics with counting and the Pnueli modalities. Theoretical Computer Science 411, 2331–2342 (2010)
Raskin, J.-F., Schobbens, P.-Y.: State clock logic: a decidable real-time logic. In: Maler, O. (ed.) HART 1997. LNCS, vol. 1201, pp. 33–47. Springer, Heidelberg (1997)
Raskin, J.-F., Schobbens, P.-Y., Henzinger, T.A.: Axioms for real-time logics. Theoretical Computer Science 274(1-2), 151–182 (2002)
The UPPAAL model checker, http://www.uppaal.org
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
Bersani, M.M., Rossi, M., Pietro, P.S. (2013). Deciding Continuous-Time Metric Temporal Logic with Counting Modalities. In: Abdulla, P.A., Potapov, I. (eds) Reachability Problems. RP 2013. Lecture Notes in Computer Science, vol 8169. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41036-9_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-41036-9_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-41035-2
Online ISBN: 978-3-642-41036-9
eBook Packages: Computer ScienceComputer Science (R0)