Related papers: Algorithmic analysis of systems with affine input …
In this paper, we consider the problem of controlling a dynamical system such that its trajectories satisfy a temporal logic property in a given amount of time. We focus on multi-affine systems and specifications given as syntactically…
In this paper we establish an abstraction of on-the-fly determinization of finite-state automata using transition monoids and demonstrate how it can be applied to bound the asymptotics. We present algebraic and combinatorial properties that…
We consider a class of systems over finite alphabets with linear internal dynamics, finite-valued control inputs and finitely quantized outputs. We motivate the need for a new notion of observability and propose three new notions of output…
We present a variety of results analyzing the behavior of a class of stochastic processes --- referred to as Stochastic Hybrid Systems (SHSs) --- in or near equilibrium, and determine general conditions on when the moments of the process…
This paper presents efficient algorithms for testing the finite, polynomial, and exponential ambiguity of finite automata with $\epsilon$-transitions. It gives an algorithm for testing the exponential ambiguity of an automaton $A$ in time…
The affine feedback connection of SISO nonlinear systems modeled by Chen--Fliess series is shown to be a group action on the plant which is isomorphic to the semi-direct product of shuffle and additive group of non-commutative formal power…
The asymptotic study of the conjugacy classes of a random element of the finite affine group leads one to define a probability measure on the set of all partitions of all positive integers. Four different probabilistic understandings of…
An alternative approach for minimum and mode-dependent dwell-time characterization for switched systems is derived. The proposed technique is related to Lyapunov looped-functionals, a new type of functionals leading to stability conditions…
Probabilistic linear solvers (PLSs) return probability distributions that quantify uncertainty due to limited computation in the solution of linear systems. The literature has traditionally distinguished between Bayesian PLSs, which…
We propose and analyze a stabilizing iteration scheme for the algorithmic implementation of model predictive control for linear discrete-time systems. Polytopic input and state constraints are considered and handled by means of so-called…
Finite-state independence is a robust notion of algorithmic independence for infinite words. It was introduced for general infinite words by Becher, Carton, and Heiber via deterministic asynchronous two-tape finite automata. \'Alvarez,…
This work considers the infinite-time discounted optimal control problem for continuous time input-affine polynomial dynamical systems subject to polynomial state and box input constraints. We propose a sequence of sum-of-squares (SOS)…
We consider stochastic and open quantum systems with a finite number of states, where a stochastic transition between two specific states is monitored by a detector. The long-time counting statistics of the observed realizations of the…
We are interested in proving input-output properties of functions that handle infinite data such as streams or non-wellfounded trees. We provide a finitary refinement type system which is (sound and) complete for Scott-open properties…
We consider the semiring of abstract finite dynamical systems up to isomorphism, with the operations of alternative and synchronous execution. We continue searching for efficient algorithms for solving polynomial equations of the form $P(X)…
This paper considers the problem of learning control laws for nonlinear polynomial systems directly from the data, which are input-output measurements collected in an experiment over a finite time period. Without explicitly identifying the…
The analysis of observable phenomena (for instance, in biology or physics) allows the detection of dynamical behaviors and, conversely, starting from a desired behavior allows the design of objects exhibiting that behavior in engineering.…
We construct a family of polynomials with real coefficients that contains as a particular case the Fej\'er and Suffridge polynomials. These polynomials allow us to suggest a robust algorithm to search for cycles of arbitrary length in…
Data-driven control of nonlinear systems with rigorous guarantees is a challenging problem as it usually calls for nonconvex optimization and requires often knowledge of the true basis functions of the system dynamics. To tackle these…
The existence of generalized steady states (GSSs) in nonlinear mechanical systems under moderate temporally aperiodic forcing has only been shown recently. Here we derive systematic expansions for such GSSs and construct a numerical…