Reachability and mortality problems for restricted hierarchical piecewise constant derivatives
DOI10.1007/978-3-319-11439-2_3zbMATH Open1448.68245OpenAlexW181543833MaRDI QIDQ3447693FDOQ3447693
Authors: Paul C. Bell, Shang Chen, Lisa Jackson
Publication date: 28 October 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-11439-2_3
Recommendations
- On the decidability and complexity of problems for restricted hierarchical hybrid systems
- Reachability problems for hierarchical piecewise constant derivative systems
- Reachability analysis of dynamical systems having piecewise-constant derivatives
- On the complexity of bounded time and precision reachability for piecewise affine systems
- Some bounds on the computational power of piecewise constant derivative systems
Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cited In (3)
This page was built for publication: Reachability and mortality problems for restricted hierarchical piecewise constant derivatives
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3447693)