Related papers: Better Quasi-Ordered Transition Systems
We study polynomial optimization problems whose objective has a composition or tensor train structure. These polynomials can be evaluated as a sequence of maps, giving rise to intermediate variables (``states'') of dimension lower than the…
Model checking is an automatic formal verification technique that is widely used in hardware verification. The state-of-the-art complete model-checking techniques, based on IC3/PDR and its general variant CAR, are based on computing…
This paper is concerned with the linear quadratic optimal control of discrete-time time-varying system with terminal state constraint. The main contribution is to propose a Q-learning algorithm for the optimal controller when the…
When a system has more than one stable state, how can the stability of these states be compared? This deceptively simple question has important consequences for ecosystems, because systems with alternative stable states can undergo dramatic…
Software is now ubiquitous and involved in complex interactions with the human users and the physical world in so-called cyber-physical systems where the management of time is a major issue. Separation of concerns is a key asset in the…
We propose a convex optimization procedure for black-box identification of nonlinear state-space models for systems that exhibit stable limit cycles (unforced periodic solutions). It extends the "robust identification error" framework in…
Commensurability is of paramount importance in numerous strongly interacting electronic systems. In the Fractional Quantum Hall effect, a rich cascade of increasingly narrow plateaux appear at larger denominator filling fractions. Rich…
Families of regimes for discrete control systems are studied possessing a special quasi-controllability property that is similar to the Kalman controllability property. A new approach is proposed to estimate the amplitudes of transient…
The chase procedure is a fundamental algorithmic tool in databases that allows us to reason with constraints, such as existential rules, with a plethora of applications. It takes as input a database and a set of constraints, and iteratively…
Although quantum correlations in a quantum system are characterized by the evolving quantities (which are entanglement and discord usually), we reveal such basis (i.e. the set of virtual particles) for the representation of the density…
A preceding paper demonstrated that explicit asymptotic methods generally work much better for extremely stiff reaction networks than has previously been shown in the literature. There we showed that for systems well removed from…
An infinite square well with a discontinuous step is one of the simplest systems to exhibit non-Newtonian ray-splitting periodic orbits in the semiclassical limit. This system is analyzed using both time-independent perturbation theory (PT)…
We present a modular semantic account of Bayesian inference algorithms for probabilistic programming languages, as used in data science and machine learning. Sophisticated inference algorithms are often explained in terms of composition of…
First-order logic has been established as an important tool for modeling and verifying intricate systems such as distributed protocols and concurrent systems. These systems are parametric in the number of nodes in the network or the number…
An overset grid method was used to investigate the interaction between a particle-laden flow and a circular cylinder. The overset grid method was implemented in the Pencil Code , a high-order finite-difference code for compressible flow…
We show that, even for extremely stiff systems, explicit integration may compete in both accuracy and speed with implicit methods if algebraic methods are used to stabilize the numerical integration. The required stabilizing algebra depends…
A new control algorithm based on the partial control method has been developed. The general situation we are considering is an orbit starting in a certain phase space region Q having a chaotic transient behavior affected by noise, so that…
In this work we provide algorithmic solutions to five fundamental problems concerning the verification, synthesis and correction of concurrent systems that can be modeled by bounded p/t-nets. We express concurrency via partial orders and…
Quasiperiodic systems serve as fertile ground for studying localisation, due to their propensity already in one dimension to exhibit rich phase diagrams with mobility edges. The deterministic and strongly-correlated nature of the…
We propose two new optimistic planning algorithms for nonlinear hybrid-input systems, in which the input has both a continuous and a discrete component, and the discrete component must respect a dwell-time constraint. Both algorithms select…