General Anticipatory Monitoring for Temporal Logics on Finite Traces

@inproceedings {1438,
	title = {General Anticipatory Monitoring for Temporal Logics on Finite Traces},
	booktitle = {23rd International Conference on Runtime Verification (RV)},
	year = {2023},
	month = {10/2023},
	publisher = {Springer Cham},
	organization = {Springer Cham},
	address = {Thessaloniki, Greece},
	abstract = {<p>Runtime Verification studies how to check a run of a system against a formal specification, typically expressed in some temporal logic. A monitor must produce a verdict at each step that is sound with respect to the specification. It is often the case that a monitor must produce a ? verdict and wait for more observations. On the other hand, sometimes a verdict is inevitable but monitoring algorithms wait to produce the verdict, because it seemingly depends on future inputs. Anticipation is the property of a monitor to immediately produce inevitable verdicts, which has been studied for logics on infinite traces. Monitoring problems depend on the logic and on the semantics that the monitor follows. In initial monitoring, at every instant the monitor answers whether the specification holds for the observed trace from the initial state. In recurrent monitoring, the monitor answers at every instant whether the specification holds at that time. In this paper we study anticipatory monitoring for temporal logics on finite traces. We first show that many logics on finite traces can be reduced linearly to Boolean Lola specifications and that initial monitoring can be reduced to recurrent monitoring for Lola. Then we present an algorithm with perfect anticipation for recurrent monitoring of Boolean Lola specifications, which we then extend to exploit assumptions and tolerate uncertainties.</p>
},
	keywords = {Assumptions, Finite Traces, Logics, Monitoring, Runtime verification, Uncertainty},
	isbn = {978-3-031-44266-7},
	doi = {10.1007/978-3-031-44267-4_6},
	url = {https://link.springer.com/chapter/10.1007/978-3-031-44267-4_6},
	author = {Hannes Kallwies and Martin Leucker and C{\'e}sar S{\'a}nchez}
}