Related papers: Algorithmic analysis of systems with affine input …
Boltzmann samplers and the recursive method are prominent algorithmic frameworks for the approximate-size and exact-size random generation of large combinatorial structures, such as maps, tilings, RNA sequences or various tree-like…
Input-affine dynamical systems often arise in control and modeling scenarios, such as the data-driven case when state-derivative observations are recorded under bounded noise. Common tasks in system analysis and control include optimal…
A numerical model based on the finite-difference time-domain method is developed to simulate fluctuations which accompany the dephasing of atomic polarization and the decay of excited state's population. This model is based on the…
We consider a recently introduced fair repetitive scheduling problem involving a set of clients, each asking for their associated job to be daily scheduled on a single machine across a finite planning horizon. The goal is to determine a job…
Zero-free based algorithm is a major technique for deterministic approximate counting. In Barvinok's original framework[Bar17], by calculating truncated Taylor expansions, a quasi-polynomial time algorithm was given for estimating zero-free…
In this paper we investigate the complexity-theoretical aspects of cyclic and non-wellfounded proofs in the context of parsimonious logic, a variant of linear logic where the exponential modality ! is interpreted as a constructor for…
We present a mathematical model: dynamical systems over finite sets (DSF), and we show that Boolean and discrete genetic models are special cases of DFS. In this paper, we prove that a function defined over finite sets with different number…
This paper treats the global stabilization problem of continuous-time switched affine systems that have rank-deficient convex combinations of their dynamic matrices. For these systems, the already known set of attainable equilibrium points…
An $\mathcal{A}$-semigroup is a numerical semigroup without consecutive small elements. This work generalizes this concept to finite-complement submonoids of an affine cone $\mathcal{C}$. We develop algorithmic procedures to compute all…
Verification of higher-order probabilistic programs is a challenging problem. We present a verification method that supports several quantitative properties of higher-order probabilistic programs. Usually, extending verification methods to…
This paper presents an abstraction-refinement method to synthesize control inputs for a discrete-time piecewise linear system. The controlled system behavior satisfies a finite-word linear-time temporal objective while incurring minimal…
Abstract State Machines (ASMs) provide a model of computations on structures rather than strings. Blass, Gurevich and Shelah showed that deterministic PTIME-bounded ASMs define the choiceless fragment of PTIME, but cannot capture PTIME. In…
This paper offers a direct data-driven approach for learning robust control barrier certificates (R-CBCs) and robust safety controllers (R-SCs) for discrete-time input-affine polynomial systems with unknown dynamics under…
We suggest a novel approach to polynomial processes solely based on a polynomial action operator. With this approach, we can analyse such processes on general state spaces, going far beyond Banach spaces. Moreover, we can be very flexible…
This note presents an online pseudospectral method for system identification using Chebyshev polynomial basis under aperiodic sampling. The system dynamics are approximated piecewise by introducing a sliding time window. The number of…
Suboptimal methods in optimal control arise due to a limited computational budget, unknown system dynamics, or a short prediction window among other reasons. Although these methods are ubiquitous, their transient performance remains…
We study measures on $\mathbb{R}^d$ which are induced by a class of infinite and recursive iterations in symbolic dynamics. Beginning with a finite set of data, we analyze prescribed recursive iteration systems, each involving subdivisions.…
We consider the concept of a local set of inference rules. A local rule set can be automatically transformed into a rule set for which bottom-up evaluation terminates in polynomial time. The local-rule-set transformation gives…
In this paper, we propose a filtering algorithm for simultaneously estimating the mode, input and state of hidden mode switched linear stochastic systems with unknown inputs. Using a multiple-model approach with a bank of linear input and…
This paper addresses data-driven control of continuous-time systems. We develop a framework based on synthesis operators associated with input and state trajectories. A key advantage of the proposed method is that it does not require the…