An Expressive Temporal Logic for Real Time
نویسندگان
چکیده
We add to the standard temporal logic with the modalities ”Until” and ”Since”, a sequence of “counting modalities”: For each n the modality Cn(X), which says that X will be true at least at n points in the next unit of time, and its past counterpart ←− C n, which says that X has happened at least n times in the last unit of time. We prove that this temporal logic is as expressive as can be hoped for; all the modalities that can be expressed in a strong natural decidable predicate logic framework, are expressible in this temporal logic.
منابع مشابه
State Clock Logic : a Decidable Real-time Logic State Clock Logic: a Decidable Real-time Logic ?
In this paper we deene a real-time logic called SC logic. This logic is deened in the framework of State Clock automata, the state variant of the Event Clock automata of Alur et al 6]. Unlike timed automata 4], they are complementable and thus language inclusion becomes decidable. SC automata and SC logic are less expressive than timed automata and MITL but seem expressive enough in practice. A...
متن کاملOn the Expressiveness and Monitoring of Metric Temporal Logic
It is known that Metric Temporal Logic (MTL) is strictly less expressive than the Monadic First-Order Logic of Order and Metric (FO[<, +1]) when interpreted over timed words; this remains true even when the time domain is bounded a priori. In this work, we present an extension of MTL with the same expressive power as FO[<, +1] over bounded timed words (and also, trivially, over time-bounded sig...
متن کاملAxioms for Real-Time Logics
This paper presents a complete axiomatization of fully decid-able propositional real-time linear temporal logics with past: the Event Clock Logic (ECL) and the Metric Interval Temporal Logic with past (MITL). The completeness proof consists of an eeective proof building procedure for ECL. From this result we obtain a complete axiomatization of MITL by providing axioms translating MITL formulae ...
متن کاملGeneralized Quantitative Temporal Reasoning: An Automata Theoretic Approach
This paper proposes an expressive extension to Propositional Linear Temporal Logic dealing with real time correctness properties and gives an automata-theoretic model checking algorithm for the extension. The algorithm has been implemented and applied to examples.
متن کاملState Clock Logic: A Decidable Real-Time Logic
In this paper we deene a real-time logic called SC logic. This logic is deened in the framework of State Clock automata, the state variant of the Event Clock automata of Alur et al 6]. Unlike timed automata 4], they are complementable and thus language inclusion becomes decidable. SC automata and SC logic are less expressive than timed automata and MITL but seem expressive enough in practice. A...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006