We consider the problem of checking whether a finite (or ultimately periodic) run satisfies a temporal logic formula. This problem is at the heart of “runtime verification” ...
In order to obtain a suitable model of the universe of discourse of some information systems, it is important to allow the description of imprecise objects with temporal indetermi...
Ed Porto Bezerra, Ulrich Schiel, Bernardo Lula Jr.
Abstract. The paper introduces the construct of temporal testers as a compositional basis for the construction of automata corresponding to temporal formulas in the PSL logic. Temp...
In this paper we study the decidability of various fragments of monodic first-order temporal logic by temporal resolution. We focus on two resolution calculi, namely, monodic tempo...
This paper describes various possible attacks on temporal properties such as temporal records of payment times and declarations of the closing times for electronic submissions, an...