Lecture notes on automata, temporal logic, and epistemic foundations of runtime verification for monitoring partially observable systems, including diagnosis, opacity, monitorability, and timed extensions.
A machine-rendered reading of the paper's core claim, the
machinery that carries it, and where it could break.
Runtime verification watches a running system to check if it meets certain rules, instead of checking every possible behavior ahead of time like model checking does. This approach works well for systems that are only partly visible or treated as black boxes, where uncertainty is resolved by observing actual executions. The notes explain how to write specifications using automata and logics, how to diagnose problems from observations, how to keep certain information hidden (opacity), and how to decide if a property can even be monitored. They also show how to build monitors from offline analysis and extend the ideas to systems with timing constraints. Because only the abstract is available here, this summary stays at the level of topics covered rather than specific technical details.
Core claim
Runtime verification complements model checking by analyzing system executions at runtime rather than exploring a complete system model in advance, and is particularly useful for partially observable or black-box systems where uncertainty can only be resolved through observation.
Load-bearing premise
The notes presuppose that readers already possess background knowledge in automata theory, temporal logic, and epistemic logic, and that the described techniques are established and correctly presented in the literature.
read the original abstract
Runtime verification is a lightweight verification technique that complements model checking by analyzing system executions at runtime rather than exploring a complete system model in advance. It is particularly useful for partially observable or black-box systems, where uncertainty can only be resolved through observation. These lecture notes present automata-theoretic, temporal-logical, and epistemic foundations of runtime verification. They cover specification formalisms, diagnosis, opacity, and monitorability, and explain how offline analysis can be used to construct monitors that operate online on observed executions. The notes also discuss timed extensions and the additional algorithmic and semantic challenges that arise in the real-time setting.
Editorial analysis
A structured set of objections, weighed in public.
Desk editor's note, referee report, simulated authors' rebuttal, and a
circularity audit. Tearing a paper down is the easy half of reading it; the
pith above is the substance, this is the friction.
As lecture notes on established topics, the abstract introduces no free parameters, axioms, or invented entities; all content draws from prior literature in automata theory and logic.
pith-pipeline@v0.9.0 ·
5384 in / 967 out tokens ·
45668 ms ·
2026-05-07T11:55:17.438350+00:00
· methodology
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.