Runtime Verification for LTL and TLTL
- 1 September 2011
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Software Engineering and Methodology
- Vol. 20 (4), 1-64
- https://doi.org/10.1145/2000799.2000800
Abstract
This article 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 feasibility of the developed methodology is demontrated using a collection of real-world temporal logic specifications. Moreover, the presented approach is 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 cosafety 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 shown, possible.Keywords
This publication has 56 references indexed in Scilit:
- Comparing LTL Semantics for Runtime VerificationJournal of Logic and Computation, 2009
- Temporal Assertions using AspectJElectronic Notes in Theoretical Computer Science, 2006
- A requirements monitoring framework for enterprise systemsRequirements Engineering, 2005
- A taxonomy and catalog of runtime software-fault monitoring toolsIEEE Transactions on Software Engineering, 2004
- Computational Analysis of Run-time Monitoring: Fundamentals of Java-MaCElectronic Notes in Theoretical Computer Science, 2002
- UPPAAL — a tool suite for automatic verification of real-time systemsLecture Notes in Computer Science, 1996
- A theory of timed automataTheoretical Computer Science, 1994
- Recognizing safety and livenessDistributed Computing, 1987
- The complexity of propositional linear temporal logicsJournal of the ACM, 1985
- Failure diagnosis of automataCybernetics and Systems Analysis, 1975