Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6875449 | Theoretical Computer Science | 2018 | 25 Pages |
Abstract
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. We also prove that a bounded precision version leads to PSPACE-complete problems.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Hugo Bazille, Olivier Bournez, Walid Gomaa, Amaury Pouly,