相关论文: A Weakness Measure for GR(1) Formulae
Reactive synthesis is concerned with finding a correct-by-construction controller from formal specifications, typically expressed in Linear Temporal Logic (LTL). The specifications describe assumptions about an environment and guarantees to…
We propose an experimental setup for the implementation of weak measurements in the context of the gedankenexperiment known as Hardy's Paradox. As Aharonov et al. showed, these weak values form a language with which the paradox can be…
Many problems in reactive synthesis are stated using two formulas ---an environment assumption and a system guarantee--- and ask for an implementation that satisfies the guarantee in environments that satisfy their assumption. Reactive…
Generalized Reactivity(1) (GR(1)) synthesis is a reactive synthesis approach in which the specification is split into two parts: a symbolic game graph, describing the safe transitions of a system, a liveness specification in a subset of…
Historically, weak values have been associated with weak measurements performed on quantum systems. Over the past two decades, a series of works have shown that weak values can be determined via measurements of arbitrary strength. One such…
The possibility of detecting weak lensing effects from deep wide field imaging surveys has open new means of probing the large-scale structures of the Universe and measuring cosmological parameters. In this paper we present a systematic…
We introduce constraints necessary for type checking a higher-order concurrent constraint language, and solve them with an incremental algorithm. Our constraint system extends rational unification by constraints x$\subseteq$ y saying that…
This paper considers the problem of assumptions refinement in the context of unrealizable specifications for reactive systems. We propose a new counterstrategy-guided synthesis approach for GR(1) specifications based on Craig's…
Auto-active program verification rests on the ability to effectively the translation from annotated programs into verification conditions that are then discharged by automated theorem provers in the background. Characteristic such tools,…
Logical specifications are widely used to represent software systems and their desired properties. Under system degradation or environmental changes, commonly seen in complex real-world robotic systems, these properties may no longer hold…
We study the selfsimilarity and the Gibbs properties of several measures defined on the product space $\Omega\_r:=\{0,1,...,\break r-1\}^{\mathbb N}$. This space can be identified with the interval $[0,1]$ by means of the numeration in base…
Prediction models are often employed in estimating parameters of optimization models. Despite the fact that in an end-to-end view, the real goal is to achieve good optimization performance, the prediction performance is measured on its own.…
Optimizing non-convex functions is a fundamental challenge across machine learning and combinatorial optimization. We introduce and study $\gamma$-weakly $\theta$-up-concavity, a novel first-order condition that characterizes a broad class…
In this, partly pedagogical review, I attempt to give a self-contained overview of the basis of (non-relativistic) QM measurement theory expressed in density matrix formalism. The focus is on applications to the theory of weak measurement,…
It is often said that measuring a system's position must disturb the complementary property, momentum, by some minimum amount due to the Heisenberg uncertainty principle. Using a "weak-measurement", this disturbance can be reduced. One…
The reactive synthesis problem is to find a finite-state controller that satisfies a given temporal-logic specification regardless of how its environment behaves. Developing a formal specification is a challenging and tedious task and…
Higher-order abstract GSOS is a recent extension of Turi and Plotkin's framework of Mathematical Operational Semantics to higher-order languages. The fundamental well-behavedness property of all specifications within the framework is that…
A key property for systems subject to uncertainty in their operating environment is robustness, ensuring that unmodelled, but bounded, disturbances have only a proportionally bounded effect upon the behaviours of the system. Inspired by…
Godelian sentences of a sufficiently strong and recursively enumerable theory, constructed in Godel's 1931 groundbreaking paper on the incompleteness theorems, are unprovable if the theory is consistent; however, they could be refutable.…
Weak values are typically obtained experimentally by performing weak measurements, which involve weak interactions between the measured system and a probe. However, the determination of weak values does not necessarily require weak…