Related papers: Reachability in Injective Piecewise Affine Maps
In real world applications, uncertain parameters are the rule rather than the exception. We present a reachability algorithm for linear systems with uncertain parameters and inputs using set propagation of polynomial zonotopes. In contrast…
In this paper we provide sufficient conditions in order to show that the set image of a continuous and shift-commuting map defined on a shift space over an arbitrary discrete alphabet is also a shift space; additionally, if such a map is…
We examine the problem of maximizing the reachability of a given source in temporal graphs that are given as the union of k temporal paths, i.e., every given path is a sequence of edges with strictly increasing labels that denote…
Measures generated by Iterated Function Systems composed of uncountably many one--dimensional affine maps are studied. We present numerical techniques as well as rigorous results that establish whether these measures are absolutely or…
We study the attractor of Iterated Function Systems composed of infinitely many affine, homogeneous maps. In the special case of second generation IFS, defined herein, we conjecture that the attractor consists of a finite number of…
We study a class of one-dimensional full branch maps admitting two indifferent fixed points as well as critical points and/or unbounded derivative. Under some mild assumptions we prove the existence of a unique invariant mixing absolutely…
Reachability in pushdown vector addition systems with states (PVASS) is among the longest standing open problems in Theoretical Computer Science. We show that the problem is decidable in full generality. Our decision procedure is similar in…
Maps $f,g\colon I\to I$ are called strongly commuting if $f\circ g^{-1}=g^{-1}\circ f$. We show that strongly commuting, piecewise monotone maps $f,g$ can be decomposed into a finite number of invariant intervals (or period 2 intervals) on…
We prove decidability results on the existence of constant subsequences of uniformly recurrent morphic sequences along arithmetic progressions. We use spectral properties of the subshifts they generate to give a first algorithm deciding…
We consider the problem of the observability of positively expansive maps by the time series associated to continuous real functions. For this purpose we prove a general result on the generic observability of a locally injective map of a…
We establish the undecidability of conditional affine information inequalities, the undecidability of the conditional independence implication problem with a constraint that one random variable is binary, and the undecidability of the…
We revisit a fundamental result in real-time verification, namely that the binary reachability relation between configurations of a given timed automaton is definable in linear arithmetic over the integers and reals. In this paper we give a…
We consider some classes of piecewise expanding maps in finite dimensional spaces having invariant probability measures which are absolutely continuous with respect to Lebesgue measure. We derive an entropy formula for such measures and,…
We consider systems made of autonomous mobile robots evolving in highly dynamic discrete environment i.e., graphs where edges may appear and disappear unpredictably without any recurrence, stability, nor periodicity assumption. Robots are…
Experiments observing the liquid surface in a vertically oscillating container have indicated that modeling the dynamics of such systems require maps that admit states at infinity. In this paper we investigate the bifurcations in such a…
Extension dimension is characterized in terms of $\omega$-maps. We apply this result to prove that extension dimension is preserved by refinable maps between metrizable spaces. It is also shown that refinable maps preserve some…
Stochastic dynamical systems consisting of non-invertible continuous maps on an interval are studied. It is proved that if they satisfy the recently introduced so-called $\mu$-injectivity and some mild assumptions, then proximality,…
In this paper we address the decision problem for a fragment of set theory with restricted quantification which extends the language studied in [4] with pair related quantifiers and constructs, in view of possible applications in the field…
We study the dynamical properties of ball expanding maps, a class of continuous self-maps defined on compact metric spaces. For a ball expanding map, we show that: (1) the set of periodic points is dense in the chain recurrent set; (2) if…
We examine the notion of anticonfinement and the role it has to play in the singularity analysis of discrete systems. A singularity is said to be anticonfined if singular values continue to arise indefinitely for the forward and backward…