Reachability Problems for One-Dimensional Piecewise Affine Maps

Piecewise affine maps (PAMs) are frequently used as a reference model to discuss the frontier between known and open questions about the decidability for reachability questions. In particular, the ...

[1]  John N. Tsitsiklis,et al.  The Stability of Saturated Linear Dynamical Systems Is Undecidable , 2001, J. Comput. Syst. Sci..

[2]  L. Bunimovich,et al.  Switched flow systems: pseudo billiard dynamics , 2004, math/0408241.

[3]  Claire J. Tomlin,et al.  Reachability Algorithm for Biological Piecewise-Affine Hybrid Systems , 2007, HSCC.

[4]  John N. Tsitsiklis,et al.  A survey of computational complexity results in systems and control , 2000, Autom..

[5]  Shang Chen,et al.  Reachability problems for systems with linear dynamics , 2016 .

[6]  Michael Dellnitz,et al.  On the isolated spectrum of the Perron-Frobenius operator , 2000 .

[7]  Nikita Sidorov,et al.  Almost Every Number Has a Continuum of β-Expansions , 2003, Am. Math. Mon..

[8]  Igor Potapov,et al.  Membership Problem in GL(2, Z) Extended by Singular Matrices , 2017, MFCS.

[9]  Michel Cosnard,et al.  Computability with Low-Dimensional Dynamical Systems , 1994, Theor. Comput. Sci..

[10]  Pascal Koiran.  The topological entropy of iterated piecewise affine maps is uncomputable , 2001, Discret. Math. Theor. Comput. Sci..

[11]  Walid Gomaa,et al.  On The Complexity of Bounded Time Reachability for Piecewise Affine Systems , 2014, RP.

[12]  Igor Potapov,et al.  Decidability of the Membership Problem for 2 × 2 integer matrices , 2016, SODA.

[13]  Amir M. Ben-Amram.  Mortality of iterated piecewise affine functions over the integers: Decidability and complexity , 2015, Comput..

[14]  Joel Ouaknine,et al.  On Termination of Integer Linear Loops , 2015, SODA.

[15]  John N. Tsitsiklis,et al.  Deciding stability and mortality of piecewise affine dynamical systems , 2001, Theor. Comput. Sci..

[16]  Amir Pnueli,et al.  Reachability Analysis of Dynamical Systems Having Piecewise-Constant Derivatives , 1995, Theor. Comput. Sci..

[17]  Igor Potapov,et al.  Reachability Problems in Low-Dimensional Iterative Maps , 2008, Int. J. Found. Comput. Sci..

[18]  Amir Pnueli,et al.  Low dimensional hybrid systems - decidable, undecidable, don't know , 2012, Inf. Comput..

[19]  N. Sidorov.  Almost every number has a continuum of beta-expansions , 2003 .

[20]  Thomas A. Henzinger,et al.  The Target Discounted-Sum Problem , 2015, 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science.

[21]  Igor Potapov,et al.  Computation in One-Dimensional Piecewise Maps and Planar Pseudo-Billiard Systems , 2005, UC.

[22]  Mickael Randour,et al.  Percentile queries in multi-dimensional Markov decision processes , 2014, CAV.

[23]  Shang Chen,et al.  Reachability and Mortality Problems for Restricted Hierarchical Piecewise Constant Derivatives , 2014, RP.

[24]  Igor Potapov,et al.  On the Identity Problem for the Special Linear Group and the Heisenberg Group , 2017, ICALP.

[25]  Sergio Callegari,et al.  Statistical modeling of discrete-time chaotic processes-basic finite-dimensional tools and applications , 2002, Proc. IEEE.

[26]  Juhani Karhumäki,et al.  On the Undecidability of Freeness of Matrix Semigroups , 1999, Int. J. Algebra Comput..

[27]  Obayashi Ippei,et al.  Computer-Assisted Verification Method for Invariant Densities and Rates of Decay of Correlations , 2011 .

[28]  A. Rényi.  Representations for real numbers and their ergodic properties , 1957 .

[29]  Igor Potapov,et al.  On undecidability bounds for matrix decision problems , 2008, Theor. Comput. Sci..

[30]  Igor Potapov,et al.  Vector Reachability Problem in SL(2, Z) , 2016, MFCS.