Article

MTL with Bounded Variability: Decidability and Complexity

Authors:

Carlo A. Furia,

Matteo RossiAuthors Info & Claims

FORMATS '08: Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems

Pages 109 - 123

https://doi.org/10.1007/978-3-540-85778-5_9

Published: 15 September 2008 Publication History

Abstract

This paper investigates the properties of Metric Temporal Logic (MTL) over models in which time is dense but phenomena are constrained to have <em>bounded variability</em>. Contrary to the case of generic dense-time behaviors, MTL is proved to be fully decidable over models with bounded variability, if the variability bound is given. In these decidable cases, MTL complexity is shown to match that of simpler decidable logics such as MITL. On the contrary, MTL is undecidable if all behaviors with variability bounded by some generic constant are considered, but with an undecidability degree that is lower than in the case of generic behaviors.

References

[1]

Alur, R., Feder, T., Henzinger, T.A.: The benefits of relaxing punctuality. Journal of the ACM 43(1), 116-146 (1996)

Digital Library

[2]

Alur, R., Henzinger, T.A.: Real-time logics: Complexity and expressiveness. Information and Computation 104(1), 35-77 (1993)

Digital Library

[3]

Asarin, E., Caspi, P., Maler, O.: Timed regular expressions. Journal of the ACM 49(2), 172- 206 (2002)

Digital Library

[4]

Bouyer, P., Markey, N., Ouaknine, J., Worrell, J.: The cost of punctuality. In: Proceedings of LICS 2007 (2007)

Digital Library

[5]

D'Souza, D., Prabhakar, P.: On the expressiveness of MTL in the pointwise and continuous semantics. Formal Methods Letters 9(1), 1-4 (2007)

[6]

M. Fränzle. Decidability of duration calculi on restricted model classes. Technical Report Kiel MF 21/1, Christian-Albrechts Universität Kiel (1996)

[7]

Furia, C.A., Pradella, M., Rossi, M.: Automated verification of dense-time MTL specifications via discrete-time approximation. In: Cuellar, J., Maibaum, T.S.E. (eds.) FM 2008. LNCS, vol. 5014, pp. 132-147. Springer, Heidelberg (2008)

[8]

Furia, C.A., Rossi, M.: Integrating discrete- and continuous-time metric temporal logics through sampling. In: Asarin, E., Bouyer, P. (eds.) FORMATS 2006. LNCS, vol. 4202, pp. 215-229. Springer, Heidelberg (2006)

[9]

Furia, C.A., Rossi, M.: MTL with bounded variability: Decidability and complexity. Technical report, DEI, Politecnico di Milano (May 2008)

[10]

Gabbay, D.M., Hodkinson, I., Reynolds, M.: Temporal Logic, vol. 1. Oxford University Press, Oxford (1994)

[11]

Hirshfeld, Y., Rabinovich, A.M.: Logics for real time: Decidability and complexity. Fundamenta Informaticae 62(1), 1-28 (2004)

Digital Library

[12]

Lutz, C., Walther, D., Wolter, F.: Quantitative temporal logics over the reals: PSPACE and below. Information and Computation 205(1), 99-123 (2007)

Digital Library

[13]

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)

Digital Library

[14]

Ouaknine, J., Worrell, J.: On the decidability and complexity of metric temporal logic over finite words. Logical Methods in Computer Science 3(1) (2007)

[15]

Rabinovich, A.: Temporal logics with incommensurable distances are undecidable. Information and Computation 205(5), 707-715 (2007)

Digital Library

[16]

Rabinovich, A.M.: Complexity of metric temporal logic with counting. In: Proceedings of FORMATS 2008. LNCS. Springer, Heidelberg (2008)

[17]

Wilke, T.: Specifying timed state sequences in powerful decidable logics and timed automata. In: Langmaack, H., de Roever, W.-P., Vytopil, J. (eds.) FTRTFT 1994. LNCS, vol. 863, pp. 694-715. Springer, Heidelberg (1994)

Cited By

Furia CSpoletini P(2017)Bounded variability of metric temporal logicAnnals of Mathematics and Artificial Intelligence10.1007/s10472-016-9532-880:3-4(283-316)Online publication date: 1-Aug-2017
https://dl.acm.org/doi/10.1007/s10472-016-9532-8
Furia CRossi M(2010)A theory of sampling for continuous-time metric temporal logicACM Transactions on Computational Logic10.1145/1838552.183856012:1(1-40)Online publication date: 26-Nov-2010
https://dl.acm.org/doi/10.1145/1838552.1838560

MTL with Bounded Variability: Decidability and Complexity

Recommendations

Bounded variability of metric temporal logic

Deciding validity of Metric Temporal Logic (MTL) formulas is generally very complex and even undecidable over dense time domains; bounded variability is one of the several restrictions that have been proposed to bring decidability back. A temporal model ...
Trakhtenbrot Theorem and First-Order Axiomatic Extensions of MTL

In 1950, B.A. Trakhtenbrot showed that the set of first-order tautologies associated to finite models is not recursively enumerable. In 1999, P. Hájek generalized this result to the first-order versions of ukasiewicz, Gödel and Product logics, w.r.t. ...
On the independence of axioms in BL and MTL

We prove that the axiom expressing that the multiplicative conjunction of two formulae implies the first one of them is redundant in the standard Hilbert-style calculi of Hájek's basic logic BL and Esteva and Godo's monoidal t-norm based logic MTL. This ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

FORMATS '08: Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems

September 2008

294 pages

ISBN:9783540857778

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 15 September 2008

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 30 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Furia CSpoletini P(2017)Bounded variability of metric temporal logicAnnals of Mathematics and Artificial Intelligence10.1007/s10472-016-9532-880:3-4(283-316)Online publication date: 1-Aug-2017
https://dl.acm.org/doi/10.1007/s10472-016-9532-8
Furia CRossi M(2010)A theory of sampling for continuous-time metric temporal logicACM Transactions on Computational Logic10.1145/1838552.183856012:1(1-40)Online publication date: 26-Nov-2010
https://dl.acm.org/doi/10.1145/1838552.1838560

View Options

View options

Figures

Tables

Media

View Table of Conten