Comparing LTL Semantics for Runtime Verification.
When monitoring a system w.r.t. a property defined in a temporal logic such as LTL, a major concern is to settle with an adequate interpretation of observable system events; that is, models of temporal logic formulae are usually infinite words of events, whereas at runtime only finite but incrementa...
Main Authors: | Bauer, A, Leucker, M, Schallhart, C |
---|---|
Format: | Journal article |
Language: | English |
Published: |
2010
|
Similar Items
-
Runtime Verification for LTL and TLTL.
by: Bauer, A, et al.
Published: (2011) -
A brief account of runtime verification.
by: Leucker, M, et al.
Published: (2009) -
Impartial Anticipation in Runtime-Verification.
by: Dong, W, et al.
Published: (2008) -
Model-based runtime analysis of distributed reactive systems.
by: Bauer, A, et al.
Published: (2006) -
LTL Verification of Automaton Programs
by: K. A. Vasileva, et al.
Published: (2007-03-01)