From LTL and Limit-Deterministic B\"uchi Automata to Deterministic Parity Automata

Controller synthesis for general linear temporal logic (LTL) objectives is a challenging task. The standard approach involves translating the LTL objective into a deterministic parity automaton (DPA) by means of the Safra-Piterman construction. One of the challenges is the size of the DPA, which often grows very fast in practice, and can reach double exponential size in the length of the LTL formula. In this paper we describe a single exponential translation from limit-deterministic B\"uchi automata (LDBA) to DPA, and show that it can be concatenated with a recent efficient translation from LTL to LDBA to yield a double exponential, \enquote{Safraless} LTL-to-DPA construction. We also report on an implementation, a comparison with the SPOT library, and performance on several sets of formulas, including instances from the 2016 SyntComp competition

A blowup criterion for ideal viscoelastic flow

We establish an analog of the Beale-Kato-Majda criterion for singularities of smooth solutions of the system of PDE arising in the Oldroyd model for ideal viscoelastic flow

On the Hybrid Extension of CTL and CTL+

The paper studies the expressivity, relative succinctness and complexity of satisfiability for hybrid extensions of the branching-time logics CTL and CTL+ by variables. Previous complexity results show that only fragments with one variable do have elementary complexity. It is shown that H1CTL+ and H1CTL, the hybrid extensions with one variable of CTL+ and CTL, respectively, are expressively equivalent but H1CTL+ is exponentially more succinct than H1CTL. On the other hand, HCTL+, the hybrid extension of CTL with arbitrarily many variables does not capture CTL*, as it even cannot express the simple CTL* property EGFp. The satisfiability problem for H1CTL+ is complete for triply exponential time, this remains true for quite weak fragments and quite strong extensions of the logic

LNCS

We define the model-measuring problem: given a model M and specification φ, what is the maximal distance ρ such that all models M′ within distance ρ from M satisfy (or violate) φ. The model measuring problem presupposes a distance function on models. We concentrate on automatic distance functions, which are defined by weighted automata. The model-measuring problem subsumes several generalizations of the classical model-checking problem, in particular, quantitative model-checking problems that measure the degree of satisfaction of a specification, and robustness problems that measure how much a model can be perturbed without violating the specification. We show that for automatic distance functions, and ω-regular linear-time and branching-time specifications, the model-measuring problem can be solved. We use automata-theoretic model-checking methods for model measuring, replacing the emptiness question for standard word and tree automata by the optimal-weight question for the weighted versions of these automata. We consider weighted automata that accumulate weights by maximizing, summing, discounting, and limit averaging. We give several examples of using the model-measuring problem to compute various notions of robustness and quantitative satisfaction for temporal specifications

Note on Global Regularity for 2D Oldroyd-B Fluids with Diffusive Stress

We prove global regularity of solutions of Oldroyd-B equations in 2 spatial dimensions with spatial diffusion of the polymeric stresses

Discounting in LTL

In recent years, there is growing need and interest in formalizing and reasoning about the quality of software and hardware systems. As opposed to traditional verification, where one handles the question of whether a system satisfies, or not, a given specification, reasoning about quality addresses the question of \emph{how well} the system satisfies the specification. One direction in this effort is to refine the "eventually" operators of temporal logic to {\em discounting operators}: the satisfaction value of a specification is a value in $[0,1]$, where the longer it takes to fulfill eventuality requirements, the smaller the satisfaction value is. In this paper we introduce an augmentation by discounting of Linear Temporal Logic (LTL), and study it, as well as its combination with propositional quality operators. We show that one can augment LTL with an arbitrary set of discounting functions, while preserving the decidability of the model-checking problem. Further augmenting the logic with unary propositional quality operators preserves decidability, whereas adding an average-operator makes some problems undecidable. We also discuss the complexity of the problem, as well as various extensions

Growth Kinetics in a Phase Field Model with Continuous Symmetry

We discuss the static and kinetic properties of a Ginzburg-Landau spherically symmetric $O(N)$ model recently introduced (Phys. Rev. Lett. {\bf 75}, 2176, (1995)) in order to generalize the so called Phase field model of Langer. The Hamiltonian contains two $O(N)$ invariant fields $\phi$ and $U$ bilinearly coupled. The order parameter field $\phi$ evolves according to a non conserved dynamics, whereas the diffusive field $U$ follows a conserved dynamics. In the limit $N \to \infty$ we obtain an exact solution, which displays an interesting kinetic behavior characterized by three different growth regimes. In the early regime the system displays normal scaling and the average domain size grows as $t^{1/2}$, in the intermediate regime one observes a finite wavevector instability, which is related to the Mullins-Sekerka instability; finally, in the late stage the structure function has a multiscaling behavior, while the domain size grows as $t^{1/4}$.Comment: 9 pages RevTeX, 9 figures included, files packed with uufiles to appear on Phy. Rev.

Analysis, Design and Implementation of an End-to-End QKD Link

This manuscript discusses the most relevant aspects of the practical implementation of a long-range Quantum Key Distribution (QKD) link with trusted nodes, achieving the highest possible secret key rate generation within the security and system level constraints. To this purpose, we report on recent pilot studies for the measurements of detection efficiency and source photon statistics for validating the calibration facilities (i) at telecom wavelength for realistic quantum backbone implementation through standard telecommunications grade optical fiber, and (ii) for the telecom and VIS-NIR regime. In addition, since there are circumstances when a fiber optical link may not be available, we will also discuss the characterization of a Free Space Optics (FSO) QKD link. Finally, the manuscript also discusses the problem of information reconciliation in Continuous Variable QKD (CV-QKD) scenarios

Experimental Aspects of Synthesis

We discuss the problem of experimentally evaluating linear-time temporal logic (LTL) synthesis tools for reactive systems. We first survey previous such work for the currently publicly available synthesis tools, and then draw conclusions by deriving useful schemes for future such evaluations. In particular, we explain why previous tools have incompatible scopes and semantics and provide a framework that reduces the impact of this problem for future experimental comparisons of such tools. Furthermore, we discuss which difficulties the complex workflows that begin to appear in modern synthesis tools induce on experimental evaluations and give answers to the question how convincing such evaluations can still be performed in such a setting.Comment: In Proceedings iWIGP 2011, arXiv:1102.374