Skip to main content


Runtime verification for LTL and TLTL


Andreas Bauer, Martin Leucker and Christian Schallhart


Australian National University

Technische Universitaet Muenchen

University of Oxford


This paper studies runtime verification of properties expressed either in lineartime temporal logic (LTL) or timed lineartime temporal logic (TLTL). It classifies runtime verification in identifying its distinguishing features to model checking and testing, respectively. It introduces a three-valued semantics (with truth values true, false, inconclusive) as an adequate interpretation as to whether a partial observation of a running system meets an LTL or TLTL property.

For LTL, a conceptually simple monitor generation procedure is given, which is optimal in two respects: First, the size of the generated deterministic monitor is minimal, and, second, the monitor identifies a continuously monitored trace as either satisfying or falsifying a property as early as possible. The presented approach is furthermore related to the properties monitorable in general and is compared to existing concepts in the literature. It is shown that the set of monitorable properties does not only encompass the safety and co-safety properties but is strictly larger. For TLTL, the same road map is followed by first defining a three-valued semantics. The corresponding construction of a timed monitor is more involved, yet, as is shown, possible.

BibTeX Entry

    journal          = {ACM Transactions on Software Engineering and Methodology},
    author           = {Bauer, Andreas and Leucker, Martin and Schallhart, Christian},
    number           = {4},
    month            = apr,
    volume           = {20},
    year             = {2011},
    keywords         = {runtime verification, temporal logic, software verification},
    title            = {Runtime Verification for {LTL} and {TLTL}},
    pages            = {75}


Served by Apache on Linux on seL4.