activity
20172025
most citedAdventures in Monitorability: From Branching to Linear Time and Back Again

40 citations · 52 across the 8 of their papers we have counts for

collaborators
Showing cs.LOShow all

6 papers · 1 filter

cs.LO2025

Monitorability for the Modal mu-Calculus over Systems with Data: From Practice to Theory

Luca Aceto, Antonis Achilleos, Duncan Paul Attard +4

Runtime verification, also known as runtime monitoring, consists of checking whether a system satisfies a given specification by observing the trace it produces during its executio…

cs.LO2019

An Operational Guide to Monitorability

Luca Aceto, Antonis Achilleos, Adrian Francalanza +2

Monitorability delineates what properties can be verified at runtime. Although many monitorability definitions exist, few are defined explicitly in terms of the guarantees provided…

cs.LO2019

The Cost of Monitoring Alone

Luca Aceto, Antonis Achilleos, Adrian Francalanza +2

We compare the succinctness of two monitoring systems for properties of infinite traces, namely parallel and regular monitors. Although a parallel monitor can be turned into an equ…

cs.LO201940 cited

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

Luca Aceto, Antonis Achilleos, Adrian Francalanza +2

This paper establishes a comprehensive theory of runtime monitorability for Hennessy-Milner logic with recursion, a very expressive variant of the modal -calculus. It investigat…

cs.LO2017

The Descriptive Complexity of Modal Model-checking Games

Karoliina Lehtinen

This paper revisits the well-established relationship between the modal mu calculus and parity games to show that it is even more robust than previously known. It addresses the que…

cs.LO2017

is decidable for

Karoliina Lehtinen, Sandra Quickert

Given a formula of the modal calculus, it is decidable whether it is equivalent to a formula.