Adventures in Monitorability: From Branching to Linear Time and Back Again

by   Luca Aceto, et al.

This paper establishes a comprehensive theory of runtime monitorability for Hennessy-Milner logic with recursion, a very expressive variant of the modal μ-calculus. It investigates the monitorability of that logic with a linear-time semantics and then compares the obtained results with ones that were previously presented in the literature for a branching-time setting. Our work establishes an expressiveness hierarchy of monitorable fragments of Hennessy-Milner logic with recursion in a linear-time setting and exactly identifies what kinds of guarantees can be given using runtime monitors for each fragment in the hierarchy. Each fragment is shown to be complete, in the sense that it can express all properties that can be monitored under the corresponding guarantees. The study is carried out using a principled approach to monitoring that connects the semantics of the logic and the operational semantics of monitors. The proposed framework supports the automatic, compositional synthesis of correct monitors from monitorable properties.



There are no comments yet.


page 1


Erratum to "Frequency Linear-time Temporal Logic"

We correct our proof of a theorem stating that satisfiability of frequen...

Simulating Linear Logic in 1-Only Linear Logic

Linear Logic was introduced by Girard as a resource-sensitive refinement...

Founded Semantics and Constraint Semantics of Logic Rules

This paper describes a simple new semantics for logic rules, founded sem...

Proper Hierarchies in Polylogarithmic Time and Absence of Complete Problems

The polylogarithmic time hierarchy structures sub-linear time complexity...

On Runtime Enforcement via Suppressions

Runtime enforcement is a dynamic analysis technique that uses monitors t...

Bidirectional Runtime Enforcement of First-Order Branching-Time Properties

Runtime enforcement is a dynamic analysis technique that instruments a m...

An Operational Guide to Monitorability

Monitorability delineates what properties can be verified at runtime. Al...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.