
Safety Metric Temporal Logic is Fully Decidable
... the formula. However, both the satisfiability and model checking problems are undecidable in the unrestricted logic, cf. [5, 17]. The main contribution of this paper is to identify a new fully decidable fragment of MTL, called Safety MTL. Safety MTL consists of those MTL formulas which, when express ...
... the formula. However, both the satisfiability and model checking problems are undecidable in the unrestricted logic, cf. [5, 17]. The main contribution of this paper is to identify a new fully decidable fragment of MTL, called Safety MTL. Safety MTL consists of those MTL formulas which, when express ...