论文信息 - On The Complexity of Bounded Time Reachability for Piecewise Affine Systems

On The Complexity of Bounded Time Reachability for Piecewise Affine Systems

Reachability for piecewise affine systems is known to be undecidable, starting from dimension 2. In this paper we investigate the exact complexity of several decidable variants of reachability and control questions for piecewise affine systems. We show in particular that the region to region bounded time versions leads to NP-complete or co-NP-complete problems, starting from dimension 2.

Walid Gomaa | Amaury Pouly | Olivier Bournez | Hugo Bazille

[1] Pravin Varaiya,et al. What's decidable about hybrid automata? , 1995, STOC '95.

[2] Cristopher Moore,et al. Generalized shifts: unpredictability and undecidability in dynamical systems , 1991 .

[3] Pascal Koiran. Computing over the Reals with Addition and Order , 1994, Theor. Comput. Sci..

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

[5] Hava T. Siegelmann,et al. On the Computational Power of Neural Nets , 1995, J. Comput. Syst. Sci..

[6] Shang Chen,et al. Reachability Problems for Hierarchical Piecewise Constant Derivative Systems , 2013, RP.

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

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

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

[10] David S. Johnson,et al. Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[11] Eugene Asarin,et al. Widening the Boundary between Decidable and Undecidable Hybrid Systems , 2002, CONCUR.

[12] Sergio Yovine,et al. On the Decidability of the Reachability Problem for Planar Differential Inclusions , 2001, HSCC.