Monitorability over Unreliable Channels

Kauffman, Sean; Havelund, Klaus; Fischmeister, Sebastian

doi:10.1007/978-3-030-32079-9_15

Cited by 6 publications

(3 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Example 6. Consider the an MITL property F [20,40] b. Monitoring the finite timed word ρ = (a, 5.1), (c, 21.0), (c, 30.4), (b, 35.1), will result in three ?…”

Section: Time Predictive Monitoringmentioning

confidence: 99%

See 1 more Smart Citation

Monitoring Timed Properties (Revisited)

Møller¹,

Kauffman²,

Larsen³

et al. 2022

Preprint

Self Cite

View full text Add to dashboard Cite

In this paper we revisit monitoring real-time systems with respect to properties expressed either in Metric Interval Temporal Logic or as Timed Büchi Automata. We offer efficient symbolic online monitoring algorithms in a number of settings, exploiting so-called zones well-known from efficient model checking of Timed Automata. The settings considered include new, much simplified treatment of time divergence, monitoring under timing uncertainty, and, extension of monitoring to offer minimum time estimates before conclusive verdicts can be made.

show abstract

“…Example 6. Consider the an MITL property F [20,40] b. Monitoring the finite timed word ρ = (a, 5.1), (c, 21.0), (c, 30.4), (b, 35.1), will result in three ?…”

Section: Time Predictive Monitoringmentioning

confidence: 99%

“…In related settings, concrete timing information may be missing for many reasons, particularly when monitoring distributed systems [19,30,28]. The problem we consider is also closely related to the robustness of TA [15] as well as work on monitoring over unreliable channels [20,21].…”

Section: Algorithmmentioning

confidence: 99%

Monitoring Timed Properties (Revisited)

Møller¹,

Kauffman²,

Larsen³

et al. 2022

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

“…There exist some variants of monitorability as well. For example, monitorability has been considered over unreliable communication channels which may reorder or lose events [30]. However, all of the existing works only consider two-valued notions of monitorability at the language-level.…”

Section: Related Workmentioning

confidence: 99%

Four-Valued Monitorability of $$\omega $$-Regular Languages

Chen

Hierons

et al. 2020

Formal Methods and Software Engineering

View full text Add to dashboard Cite

The use of runtime verification has led to interest in deciding whether a property is monitorable: whether it is always possible for the satisfaction or violation of the property to be determined after a finite future continuation during system execution. However, classical two-valued monitorability suffers from two inherent limitations, which eventually increase runtime overhead. First, no information is available regarding whether only one verdict (satisfaction or violation) can be detected. Second, it does not tell us whether verdicts can be detected starting from the current monitor state during system execution.This paper proposes a new notion of four-valued monitorability for ω-languages and applies it at the state-level. Four-valued monitorability is more informative than two-valued monitorability as a property can be evaluated as a four-valued result, denoting that only satisfaction, only violation, or both are active for a monitorable property. We can also compute state-level weak monitorability, i.e., whether satisfaction or violation can be detected starting from a given state in a monitor, which enables state-level optimizations of monitoring algorithms. Based on a new six-valued semantics, we propose procedures for computing fourvalued monitorability of ω-regular languages, both at the language-level and at the state-level. Experimental results show that our tool implementation Monic can correctly, and quickly, report both two-valued and four-valued monitorability.

show abstract