Abstract
This paper investigates the properties of Metric Temporal Logic (MTL) over models in which time is dense but phenomena are constrained to have bounded variability. 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. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Furia, C. A., & Rossi, M. (2008). MTL with bounded variability: Decidability and complexity. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5215 LNCS, pp. 109–123). https://doi.org/10.1007/978-3-540-85778-5_9
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
