Runtime Verification for LTL and TLTL
-
Altmetric Citations
Bauer, Andreas; Leucker, Martin; Schallhart, Christian
Description
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...[Show more]
dc.contributor.author | Bauer, Andreas | |
---|---|---|
dc.contributor.author | Leucker, Martin | |
dc.contributor.author | Schallhart, Christian | |
dc.date.accessioned | 2015-12-08T22:42:15Z | |
dc.identifier.issn | 1049-331X | |
dc.identifier.uri | http://hdl.handle.net/1885/37011 | |
dc.description.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. | |
dc.publisher | ASME Digital Library | |
dc.source | ACM Transactions on Software Engineering and Methodology | |
dc.subject | Keywords: Assertion checkers; Linear time temporal logic; Partial observation; Road-maps; Running systems; Runtime verification; Temporal logic specifications; Three-valued; Truth values; Display devices; Model checking; Semantics; Temporal logic Assertion checkers; Monitors; Runtime verification | |
dc.title | Runtime Verification for LTL and TLTL | |
dc.type | Journal article | |
local.description.notes | Imported from ARIES | |
local.identifier.citationvolume | 20 | |
dc.date.issued | 2011 | |
local.identifier.absfor | 080309 - Software Engineering | |
local.identifier.ariespublication | u4963866xPUB143 | |
local.type.status | Published Version | |
local.contributor.affiliation | Bauer, Andreas, College of Engineering and Computer Science, ANU | |
local.contributor.affiliation | Leucker, Martin, Technische Universitat Munchen | |
local.contributor.affiliation | Schallhart, Christian, Technische Universitat Darmstadt | |
local.description.embargo | 2037-12-31 | |
local.bibliographicCitation.issue | 4 | |
local.bibliographicCitation.startpage | 69 | |
local.identifier.doi | 10.1145/2000799.2000800 | |
local.identifier.absseo | 890299 - Computer Software and Services not elsewhere classified | |
dc.date.updated | 2016-02-24T11:30:00Z | |
local.identifier.scopusID | 2-s2.0-79960344619 | |
Collections | ANU Research Publications |
Download
File | Description | Size | Format | Image |
---|---|---|---|---|
01_Bauer_Runtime_Verification_for_LTL_2011.pdf | 714.7 kB | Adobe PDF | Request a copy | |
02_Bauer_Runtime_Verification_for_LTL_2011.pdf | 800.17 kB | Adobe PDF | Request a copy |
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.
Updated: 17 November 2022/ Responsible Officer: University Librarian/ Page Contact: Library Systems & Web Coordinator