Reachability Problems for Hierarchical Piecewise Constant Derivative Systems
From MaRDI portal
Publication:5168512
DOI10.1007/978-3-642-41036-9_6zbMath1407.68281OpenAlexW166394786MaRDI QIDQ5168512
Publication date: 7 July 2014
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://dspace.lboro.ac.uk/2134/13390
Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (3)
On The Complexity of Bounded Time Reachability for Piecewise Affine Systems ⋮ On the complexity of bounded time and precision reachability for piecewise affine systems ⋮ On the decidability and complexity of problems for restricted hierarchical hybrid systems
This page was built for publication: Reachability Problems for Hierarchical Piecewise Constant Derivative Systems
