If At First You Don't Succeed: Extended Monitorability through Multiple Executions
Antonis Achilleos, Adrian Francalanza, Jasmine Xuereb
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.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 32d3bcd0-9413-468f-a330-c67d8d28eebcBuilds on1
Related papers
- Verifying Asynchronous Hyperproperties in Reactive SystemsRaven Beutner, Bernd FinkbeinerOOPSLA 2025 · 2 citations
- Monitoring Arithmetic Temporal Properties on Finite TracesPaolo Felli, Marco Montali, Fabio Patrizi, Sarah WinklerAAAI 2023 · 14 citations
- HFL(Z) Validity Checking for Automated Program VerificationNaoki Kobayashi, Kento Tanahashi, Ryosuke Sato, Takeshi TsukadaPOPL 2023 · 8 citations
- A Temporal Logic for Asynchronous HyperpropertiesJan Baumeister, Norine Coenen, Borzoo Bonakdarpour, Bernd Finkbeiner et al.CAV 2021 · 52 citations
- Semantics of Sets of ProgramsJinwoo Kim, Shaan Nagy, Thomas Reps, Loris D'AntoniOOPSLA 2025 · 1 citation
