If At First You Don’t Succeed: Extended Monitorability through Multiple Executions

This paper studies the extent to which branching-time properties can be adequately verified using runtime monitors. We depart from the classical setup where monitoring is limited to a single system execution and investigate the enhanced observational capabilities when monitoring a system over multiple runs. To ensure generality, we focus on branching-time properties expressed in the modal µ-calculus, a well-studied foundational logic. Our results show that the proposed setup can systematically extend established monitorability limits for branching-time properties. We validate our results by instantiating them to verify actor-based systems. We also prove bounds that capture the correspondence between the syntactic structure of a property and the number of required system runs.

Authors

Institutions

Publication Details

Published
2025-06-23
DOI
https://doi.org/10.1109/lics65433.2025.00054
Citations
1
Primary Topic
Software Reliability and Analysis Research
Type
article
Field-Weighted Citation Impact
2.31
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

If At First You Don’t Succeed: Extended Monitorability through Multiple Executions

Antonis Achilleos, Jasmine Xuereb, Adrian Francalanza
1 citations
Software Reliability and Analysis Research
2.31
article

If At First You Don’t Succeed: Extended Monitorability through Multiple Executions

Antonis Achilleos, Jasmine Xuereb, Adrian Francalanza
article en
1 citations

Abstract

This paper studies the extent to which branching-time properties can be adequately verified using runtime monitors. We depart from the classical setup where monitoring is limited to a single system execution and investigate the enhanced observational capabilities when monitoring a system over multiple runs. To ensure generality, we focus on branching-time properties expressed in the modal µ-calculus, a well-studied foundational logic. Our results show that the proposed setup can systematically extend established monitorability limits for branching-time properties. We validate our results by instantiating them to verify actor-based systems. We also prove bounds that capture the correspondence between the syntactic structure of a property and the number of required system runs.

Reykjavík University (IS), University of Malta (MT)
Openalex Percentile: Top 10%
Software Reliability and Analysis Research
2.31
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.