{"publication_status":"published","volume":13992,"ddc":["000"],"scopus_import":"1","month":"04","publication":"26th International Conference Foundations of Software Science and Computation Structures","citation":{"mla":"Henzinger, Thomas A., et al. “Quantitative Safety and Liveness.” 26th International Conference Foundations of Software Science and Computation Structures, vol. 13992, Springer Nature, 2023, pp. 349–70, doi:10.1007/978-3-031-30829-1_17.","ista":"Henzinger TA, Mazzocchi NA, Sarac NE. 2023. Quantitative safety and liveness. 26th International Conference Foundations of Software Science and Computation Structures. FOSSACS: Foundations of Software Science and Computation Structures, LNCS, vol. 13992, 349–370.","short":"T.A. Henzinger, N.A. Mazzocchi, N.E. Sarac, in:, 26th International Conference Foundations of Software Science and Computation Structures, Springer Nature, 2023, pp. 349–370.","ieee":"T. A. Henzinger, N. A. Mazzocchi, and N. E. Sarac, “Quantitative safety and liveness,” in 26th International Conference Foundations of Software Science and Computation Structures, Paris, France, 2023, vol. 13992, pp. 349–370.","apa":"Henzinger, T. A., Mazzocchi, N. A., & Sarac, N. E. (2023). Quantitative safety and liveness. In 26th International Conference Foundations of Software Science and Computation Structures (Vol. 13992, pp. 349–370). Paris, France: Springer Nature. https://doi.org/10.1007/978-3-031-30829-1_17","ama":"Henzinger TA, Mazzocchi NA, Sarac NE. Quantitative safety and liveness. In: 26th International Conference Foundations of Software Science and Computation Structures. Vol 13992. Springer Nature; 2023:349-370. doi:10.1007/978-3-031-30829-1_17","chicago":"Henzinger, Thomas A, Nicolas Adrien Mazzocchi, and Naci E Sarac. “Quantitative Safety and Liveness.” In 26th International Conference Foundations of Software Science and Computation Structures, 13992:349–70. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-30829-1_17."},"status":"public","acknowledgement":"We thank the anonymous reviewers for their helpful comments. This work was supported in part by the ERC-2020-AdG 101020093.","external_id":{"arxiv":["2301.11175"]},"author":[{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A"},{"first_name":"Nicolas Adrien","id":"b26baa86-3308-11ec-87b0-8990f34baa85","last_name":"Mazzocchi","full_name":"Mazzocchi, Nicolas Adrien"},{"last_name":"Sarac","id":"8C6B42F8-C8E6-11E9-A03A-F2DCE5697425","first_name":"Naci E","full_name":"Sarac, Naci E"}],"has_accepted_license":"1","date_updated":"2023-07-14T11:20:27Z","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","year":"2023","_id":"12467","quality_controlled":"1","doi":"10.1007/978-3-031-30829-1_17","alternative_title":["LNCS"],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"type":"conference","file":[{"file_id":"12468","success":1,"access_level":"open_access","date_updated":"2023-01-31T07:22:21Z","date_created":"2023-01-31T07:22:21Z","file_size":449027,"creator":"esarac","checksum":"981025aed580b6b27c426cb8856cf63e","file_name":"qsl.pdf","relation":"main_file","content_type":"application/pdf"},{"date_created":"2023-06-19T10:28:09Z","file_size":1048171,"date_updated":"2023-06-19T10:28:09Z","checksum":"f16e2af1e0eb243158ab0f0fe74e7d5a","creator":"dernst","file_name":"2023_LNCS_HenzingerT.pdf","relation":"main_file","content_type":"application/pdf","file_id":"13153","access_level":"open_access","success":1}],"publisher":"Springer Nature","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"oa":1,"abstract":[{"lang":"eng","text":"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 and a quantitative liveness property. Consequently, like boolean properties, also quantitative properties can be min-decomposed into safety and liveness parts, or alternatively, max-decomposed into co-safety and co-liveness parts. Moreover, quantitative properties can be approximated naturally. We prove that every quantitative property that has both safe and co-safe approximations can be monitored arbitrarily precisely by a monitor that uses only a finite number of states."}],"ec_funded":1,"conference":{"start_date":"2023-04-22","end_date":"2023-04-27","location":"Paris, France","name":"FOSSACS: Foundations of Software Science and Computation Structures"},"date_published":"2023-04-21T00:00:00Z","oa_version":"Published Version","file_date_updated":"2023-06-19T10:28:09Z","publication_identifier":{"isbn":["9783031308284"],"eissn":["1611-3349"],"issn":["0302-9743"]},"date_created":"2023-01-31T07:23:56Z","language":[{"iso":"eng"}],"article_processing_charge":"No","title":"Quantitative safety and liveness","page":"349-370","day":"21","project":[{"name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020"}],"intvolume":" 13992"}