MTL with Bounded Variability: Decidability and Complexity
نویسندگان
چکیده
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.
منابع مشابه
On the Decidability and Complexity of Some Fragments of Metric Temporal Logic
Metric Temporal Logic, MTL[UI , SI ], is amongst the most studied real-time logics. It exhibits considerable diversity in expressiveness and decidability properties based on the permitted set of modalities and the nature of time interval constraints I . In this paper, we sharpen the decidability results by showing that the satisfiability of MTL [ UI , SNS] (where NS denotes non-singular interva...
متن کاملTime-Bounded Verification
We study the decidability and complexity of verification problems for timed automata over time intervals of fixed, bounded length. One of our main results is that time-bounded language inclusion for timed automata is 2EXPSPACE-Complete. We also investigate the satisfiability and model-checking problems for Metric Temporal Logic (MTL), as well as monadic firstand second-order logics over the rea...
متن کاملDiscrete Meets Continuous, Again
This report collects some contributions about issues related to the notion of sampling invariance that has been introduced in [FR05, FR06], of which the present report can therefore be considered a follow-up and a complement. In particular: we compare the expressiveness of the language TRIO against that of MTL (and MITL), by also showing a result about the expressiveness of non-strict temporal ...
متن کاملOn the decidability and complexity of Metric Temporal Logic over finite words
Metric Temporal Logic (MTL) is a prominent specification formalism for realtime systems. In this paper, we show that the satisfiability problem for MTL over finite timed words is decidable, with non-primitive recursive complexity. We also consider the model-checking problem for MTL: whether all words accepted by a given Alur-Dill timed automaton satisfy a given MTL formula. We show that this pr...
متن کاملSafety Metric Temporal Logic Is Fully Decidable
Metric Temporal Logic (MTL) is a widely-studied real-time extension of Linear Temporal Logic. In this paper we consider a fragment of MTL, called Safety MTL, capable of expressing properties such as invariance and time-bounded response. Our main result is that the satisfiability problem for Safety MTL is decidable. This is the first positive decidability result for MTL over timed ω-words that d...
متن کامل