Quantitative Safety and Liveness
Thomas A. Henzinger, Nicolas Mazzocchi, N. Ege Sara\c{c}

TL;DR
This paper extends safety and liveness concepts to quantitative properties, providing a framework for their decomposition, approximation, and monitoring, thus generalizing classical boolean property classifications.
Contribution
It introduces definitions of quantitative safety and liveness, proving they generalize boolean classifications and enable decomposition and approximation of quantitative properties.
Findings
Every quantitative property can be decomposed into safety and liveness parts.
Quantitative properties with safe and co-safe approximations can be monitored precisely.
The framework generalizes classical boolean safety-liveness hierarchy to quantitative settings.
Abstract
Safety and liveness are elementary concepts of computation, and the foundation of many verification paradigms. The safety-liveness classification of boolean properties characterizes whether a given property can be falsified by observing a finite prefix of an infinite computation trace (always for safety, never for liveness). In quantitative specification and verification, properties assign not truth values, but quantitative values to infinite traces (e.g., a cost, or the distance to a boolean property). We introduce quantitative safety and liveness, and we prove that our definitions induce conservative quantitative generalizations of both (1)~the safety-progress hierarchy of boolean properties and (2)~the safety-liveness decomposition of boolean properties. In particular, we show that every quantitative property can be written as the pointwise minimum of a quantitative safety property…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFormal Methods in Verification · Logic, programming, and type systems · Logic, Reasoning, and Knowledge
