Related papers: Efficient Algorithms for Checking Fast Termination…
Vector addition systems with states (VASS) are a classic model in concurrency theory. Grammar vector addition systems (GVAS), equivalently, pushdown VASS, extend VASS by using a context-free grammar to control addition. In this paper, our…
We consider history-determinism, a restricted form of non-determinism, for Vector Addition Systems with States (VASS) when used as acceptors to recognise languages of finite words. History-determinism requires that the non-deterministic…
Vector addition systems are an important model in theoretical computer science and have been used in a variety of areas. In this paper, we consider vector addition systems with states over a parameterized initial configuration. For these…
The problem of finding an optimum using noisy evaluations of a smooth cost function arises in many contexts, including economics, business, medicine, experiment design, and foraging theory. We derive an asymptotic bound E[ (x_t - x*)^2 ] >=…
This work presents a sum-of-squares (SOS) based framework to perform data-driven stabilization and robust control tasks on discrete-time linear systems where the full-state observations are corrupted by L-infinity bounded input,…
Stochastic approximation (SA) is an iterative algorithm for finding the fixed point of an operator using noisy samples and widely used in optimization and Reinforcement Learning (RL). The noise in RL exhibits a Markovian structure, and in…
We interpret steady linear statistical inverse problems as artificial dynamic systems with white noise and introduce a stochastic differential equation (SDE) system where the inverse of the ending time $T$ naturally plays the role of the…
This paper studies a version of the counting problem in dynamical systems that is of interest, especially in conformal dynamical systems where the functions of the systems are angle preserving. Recently, M. Pollicott and M. Urba\'{n}ski…
Regularized system identification is the major advance in system identification in the last decade. Although many promising results have been achieved, it is far from complete and there are still many key problems to be solved. One of them…
We consider the stability and the input-output analysis problems of a class of large-scale hybrid systems composed of continuous dynamics coupled with discrete dynamics defined over finite alphabets, e.g., deterministic finite state…
We study randomly stopped sums via their asymptotic scales. First, finiteness of moments is considered. To generalise this study, asymptotic scales applicable to the class of all heavy-tailed random variables are used. The stopping is…
We construct asymptotic expansions of Laplace type for the time-dependent quantum averages for Bose systems with many degrees of freedom, initially populated in coherent states. These solutions are localized in phase space, and they are…
We study computational questions related with the stability of discrete-time linear switching systems with switching sequences constrained by an automaton. We first present a decidable sufficient condition for their boundedness when the…
This is a technical report that extends and clarifies the results presented in [1]. The model identification problem for asymptotically stable linear time invariant systems is considered. The system output is affected by an additive noise…
We study the problems of asymptotic and approximate consensus in which agents have to get their values arbitrarily close to each others' inside the convex hull of initial values, either without or with an explicit decision by the agents. In…
This paper concerns the large time asymptotic behavior of solutions to the free boundary problem of the compressible primitive equations in atmospheric dynamics with physical vacuum. Up to second order of the perturbations of an…
Error bounds and complexity bounds in numerical analysis and information-based complexity are often proved for functions that are defined on very simple domains, such as a cube, a torus, or a sphere. We study optimal error bounds for the…
In the language-theoretic approach to refinement verification, we check that the language of traces of an implementation all belong to the language of a specification. We consider the refinement verification problem for asynchronous…
We describe methods for proving bounds on infinite-time averages in differential dynamical systems. The methods rely on the construction of nonnegative polynomials with certain properties, similarly to the way nonlinear stability can be…
We are concerned with the uniqueness of the asymptotic behavior of strong solutions of the initial-boundary value problem for general semilinear parabolic equations by the asymptotic behavior of these strong solutions on a finite set of an…