Runtime Verification for LTL and TLTL
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]
|Collections||ANU Research Publications|
|Source:||ACM Transactions on Software Engineering and Methodology|
|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.