English
Related papers

Related papers: Quantitative Safety and Liveness

200 papers

Safety and liveness stand as fundamental concepts in formal languages, playing a key role in verification. The safety-liveness classification of boolean properties characterizes whether a given property can be falsified by observing a…

Formal Languages and Automata Theory · Computer Science 2025-04-16 Udi Boker , Thomas A. Henzinger , Nicolas Mazzocchi , N. Ege Saraç

In runtime verification, a monitor watches a trace of a system and, if possible, decides after observing each finite prefix whether or not the unknown infinite trace satisfies a given specification. We generalize the theory of runtime…

Logic in Computer Science · Computer Science 2025-06-30 Thomas A. Henzinger , N. Ege Saraç

The distinction between safety and liveness properties is a fundamental classification with immediate implications on the feasibility and complexity of various monitoring, model checking, and synthesis problems. In this paper, we revisit…

Formal Languages and Automata Theory · Computer Science 2011-06-08 Rüdiger Ehlers , Bernd Finkbeiner

Quantitative aspects of computation are related to the use of both physical and mathematical quantities, including time, performance metrics, probability, and measures for reliability and security. They are essential in characterizing the…

Programming Languages · Computer Science 2020-01-22 Alessandro Aldini

Neural networks are increasingly employed in safety-critical domains. This has prompted interest in verifying or certifying logically encoded properties of neural networks. Prior work has largely focused on checking existential properties,…

Cryptography and Security · Computer Science 2019-06-26 Teodora Baluta , Shiqi Shen , Shweta Shinde , Kuldeep S. Meel , Prateek Saxena

This paper presents a formal characterisation of safety and liveness properties \`a la Alpern and Schneider for fully probabilistic systems. As for the classical setting, it is established that any (probabilistic tree) property is…

Logic in Computer Science · Computer Science 2014-05-19 Joost-Pieter Katoen , Lei Song , Lijun Zhang

We introduce notions of safety, liveness, and fairness, as commonly used in temporal reasoning, to quantitative (bipolar) argumentation dialogues where repeated inferences are drawn from argumentation graphs with weighted nodes. Between…

Multiagent Systems · Computer Science 2026-05-25 Arunavo Ganguly , Julian Alfredo Mendez , Timotheus Kampik

Coherence and entanglement are fundamental properties of quantum systems, promising to power the near future quantum computers, sensors and simulators. Yet, their experimental detection is challenging, usually requiring full reconstruction…

Quantum Physics · Physics 2017-08-01 Graeme Smith , John A. Smolin , Xiao Yuan , Qi Zhao , Davide Girolami , Xiongfeng Ma

Entanglement and coherence are fundamental properties of quantum systems, promising to power near future quantum technologies, such as quantum computation, quantum communication and quantum metrology. Yet, their quantification, rather than…

This thesis is concerned with quantitative verification, that is, the verification of quantitative properties of quantitative systems. These systems are found in numerous applications, and their quantitative verification is important, but…

Logic in Computer Science · Computer Science 2022-04-26 Uli Fahrenberg

We introduce probability estimation, a broadly applicable framework to certify randomness in a finite sequence of measurement results without assuming that these results are independent and identically distributed. Probability estimation…

Quantum Physics · Physics 2018-11-30 Yanbao Zhang , Emanuel Knill , Peter Bierhorst

The outcomes of a series of measurements, made on a quantum system, form a sequence of random events which occur in a particular order. The system, together with a meter or meters, can be seen as following the paths of a stochastic network…

Quantum Physics · Physics 2016-08-01 D. Sokolovski

Quantitative aspects of computation are important and sometimes essential in characterising the behavior and determining the properties of systems. They are related to the use of physical quantities (storage space, time, bandwidth, etc.) as…

Logic in Computer Science · Computer Science 2013-08-15 Luca Bortolussi , Herbert Wiklicky

This paper presents a novel approach for augmenting proof-based verification with performance-style analysis of the kind employed in state-of-the-art model checking tools for probabilistic systems. Quantitative safety properties usually…

Logic in Computer Science · Computer Science 2009-12-11 Ukachukwu Ndukwu

Characterizing increasingly complex quantum systems is a central task in quantum information science, yet experimental costs often scale prohibitively with system size. Certifying key properties using simple local measurements is highly…

Quantum Physics · Physics 2026-05-21 Zhenyu Du , Jinchang Liu , Elias X. Huber , Zi-Wen Liu , Xiongfeng Ma

Monitorability delineates what properties can be verified at runtime. Although many monitorability definitions exist, few are defined explicitly in terms of the guarantees provided by monitors, i.e., the computational entities carrying out…

Logic in Computer Science · Computer Science 2019-06-04 Luca Aceto , Antonis Achilleos , Adrian Francalanza , Anna Ingólfsdóttir , Karoliina Lehtinen

Hyperproperties allow one to specify properties of systems that inherently involve not single executions of the system, but several of them at once: observational determinism and non-inference are two examples of such properties used to…

Logic in Computer Science · Computer Science 2025-12-02 Samuel Graepler , Benjamin Monmege , Jean-Marc Talbot

Many important cryptographic primitives offer probabilistic guarantees of security that can be specified as quantitative hyperproperties; these are specifications that stipulate the existence of a certain number of traces in the system…

Cryptography and Security · Computer Science 2020-05-18 Shubham Sahai , Rohit Sinha , Pramod Subramanyan

Hyperproperties relate multiple executions of a program and are commonly used to specify security and information-flow policies. Most existing work has focused on the verification of $k$-safety properties, i.e., properties that state that…

Logic in Computer Science · Computer Science 2024-03-07 Raven Beutner

Contextuality is a feature of quantum correlations. It is crucial from a foundational perspective as a nonclassical phenomenon, and from an applied perspective as a resource for quantum advantage. It is commonly defined in terms of hidden…

‹ Prev 1 2 3 10 Next ›