Monitoring for a decidable fragment of MTLD
نویسندگان
چکیده
Temporal logics targeting real-time systems are traditionally undecidable. Based on a restricted fragment of MTLD, we propose a new approach for the runtime verification of hard real-time systems. The novelty of our technique is that it is based on incremental evaluation, allowing us to effectively treat duration properties (which play a crucial role in real-time systems). We describe the two levels of operation of our approach: offline simplification by quantifier removal techniques; and online evaluation of a three-valued interpretation for formulas of our fragment. Our experiments show the applicability of this mechanism as well as the validity of the provided complexity results. Monitoring for a decidable fragment of MTL∫ André de Matos Pedro, David Pereira, Lúıs Miguel Pinho, and Jorge Sousa Pinto 1 CISTER/INESC TEC, ISEP, Polytechnic Institute of Porto, Portugal 2 HASLab/INESC TEC & Universidade do Minho, Portugal Abstract. Temporal logics targeting real-time systems are traditionally undecidable. Based on a restricted fragment of MTL∫ Temporal logics targeting real-time systems are traditionally undecidable. Based on a restricted fragment of MTL∫ , we propose a new approach for the runtime verification of hard real-time systems. The novelty of our technique is that it is based on incremental evaluation, allowing us to effectively treat duration properties (which play a crucial role in real-time systems). We describe the two levels of operation of our approach: offline simplification by quantifier removal techniques; and online evaluation of a three-valued interpretation for formulas of our fragment. Our experiments show the applicability of this mechanism as well as the validity of the provided complexity results.
منابع مشابه
Mannitol-1-phosphate dehydrogenase (MtlD) is required for mannitol and glucitol assimilation in Bacillus subtilis: possible cooperation of mtl and gut operons.
We found that mannitol-1-phosphate dehydrogenase (MtlD), a component of the mannitol-specific phosphotransferase system, is required for glucitol assimilation in addition to GutR, GutB, and GutP in Bacillus subtilis. Northern hybridization of total RNA and microarray studies of RNA from cells cultured on glucose, mannitol, and glucitol indicated that mannitol as the sole carbon source induced h...
متن کاملEfficient Algorithms for Deciding Properties of Heaps using STRAND
In recent work [8], we defined a logic called Strand that expresses properties of heaps combined with the data stored in the nodes of the heap. The salient feature of this logic is that it can state complex properties of heaps with data, and also admits decidable fragments. We had identified both a semantic fragment of Strand, as well as a syntactic fragment of it that is decidable. The decisio...
متن کاملA Decidable Fragment of Second Order Logic With Applications to Synthesis
We propose a fragment of many-sorted second order logic ESMT and show that checking satisfiability of sentences in this fragment is decidable. This logic has an $\exists^*\forall^*$ quantifier prefix that is conducive to modeling synthesis problems. Moreover, it allows reasoning using a combination of background theories provided that they have a decidable satisfiability problem for the $\exist...
متن کاملOn the Boundary of (Un)decidability: Decidable Model-Checking for a Fragment of Resource Agent Logic
The model-checking problem for Resource Agent Logic is known to be undecidable. We review existing (un)decidability results and identify a significant fragment of the logic for which model checking is decidable. We discuss aspects which makes model checking decidable and prove undecidability of two open fragments over a class of models in which agents always have a choice of doing nothing.
متن کاملEfficient Decision Procedures for Heaps Using STRAND
The Strand [10] logic allows expressing structural properties of heaps combined with the data stored in the nodes of the heap. A semantic fragment of Strand as well as a syntactically defined subfragment of it are known to be decidable [10]. The known decision procedure works by combining a decision procedure for MSO on trees (implemented by the tool Mona) and a decision procedure for the quant...
متن کامل