Runtime verification using a temporal description logic
FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
LTL Goal Specifications Revisited
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
ICTSS'10 Proceedings of the 22nd IFIP WG 6.1 international conference on Testing software and systems
You should better enforce than verify
RV'10 Proceedings of the First international conference on Runtime verification
Runtime Verification for LTL and TLTL
ACM Transactions on Software Engineering and Methodology (TOSEM)
Sampling-based runtime verification
FM'11 Proceedings of the 17th international conference on Formal methods
Monitoring business constraints with linear temporal logic: an approach based on colored automata
BPM'11 Proceedings of the 9th international conference on Business process management
Runtime verification of component-based systems
SEFM'11 Proceedings of the 9th international conference on Software engineering and formal methods
Annals of Mathematics and Artificial Intelligence
Using temporal logic for dynamic reconfigurations of components
FACS'10 Proceedings of the 7th international conference on Formal Aspects of Component Software
An asymptotically correct finite path semantics for LTL
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
RV'11 Proceedings of the Second international conference on Runtime verification
Runtime verification of LTL-Based declarative process models
RV'11 Proceedings of the Second international conference on Runtime verification
Efficient techniques for near-optimal instrumentation in time-triggered runtime verification
RV'11 Proceedings of the Second international conference on Runtime verification
Runtime verification of traces under recording uncertainty
RV'11 Proceedings of the Second international conference on Runtime verification
Monitoring temporal information flow
ISoLA'12 Proceedings of the 5th international conference on Leveraging Applications of Formal Methods, Verification and Validation: technologies for mastering change - Volume Part I
Introduction to the special issue on runtime verification
Formal Methods in System Design
Representing and monitoring social commitments using the event calculus
Autonomous Agents and Multi-Agent Systems
Dynamic logic with trace semantics
CADE'13 Proceedings of the 24th international conference on Automated Deduction
International Journal of Web Services Research
Hi-index | 0.00 |
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 incrementally expanding prefixes are available. In this work, we review LTL-derived logics for finite traces from a runtime-verification perspective. In doing so, we establish four maxims to be satisfied by any LTL-derived logic aimed at runtime verification. As no pre-existing logic readily satisfies all of them, we introduce a new four-valued logic Runtime Verification Linear Temporal Logic RV-LTL in accordance to these maxims. The semantics of Runtime Verification Linear Temporal Logic (RV-LTL) indicates whether a finite word describes a system behaviour which either (i) satisfies the monitored property, (ii) violates the property, (iii) will presumably violate the property, or (iv) will presumably conform to the property in the future, once the system has stabilized. Notably, (i) and (ii) correspond to the classical semantics of LTL, whereas (iii) and (iv) are chosen whenever an observed system behaviour has not yet lead to a violation or acceptance of the monitored property. Moreover, we present a monitor construction for RV-LTL properties in terms of Moore machines signalizing the semantics of the so far obtained execution trace w.r.t. the monitored property.