On the decidability and complexity of problems for restricted hierarchical hybrid systems
DOI10.1016/J.TCS.2016.09.003zbMATH Open1353.68158OpenAlexW2520428934MaRDI QIDQ338386FDOQ338386
Authors: Paul C. Bell, Shang Chen, Lisa Jackson 
Publication date: 4 November 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2016.09.003
Recommendations
- Reachability and mortality problems for restricted hierarchical piecewise constant derivatives
- Reachability problems for hierarchical piecewise constant derivative systems
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- What's decidable about hybrid automata?
- Reachability analysis of dynamical systems having piecewise-constant derivatives
mortalityhybrid systemsreachability(hierarchical) piecewise constant derivativespiecewise affine maps
Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Updatable timed automata
- Title not available (Why is that?)
- The algorithmic analysis of hybrid systems
- When is a pair of matrices mortal?
- A survey of computational complexity results in systems and control
- Undecidability bounds for integer matrices using Claus instances
- Computability with low-dimensional dynamical systems
- Reachability analysis of dynamical systems having piecewise-constant derivatives
- The mortality problem for matrices of low dimensions
- Algorithmic analysis of polygonal hybrid systems. I: Reachability
- Mortality of Iterated Piecewise Affine Functions over the Integers: Decidability and Complexity (extended abstract)
- Hybrid Systems Forming Strange Billiards
- Reachability and mortality problems for restricted hierarchical piecewise constant derivatives
- REACHABILITY PROBLEMS IN LOW-DIMENSIONAL ITERATIVE MAPS
- MATRIX EQUATIONS AND HILBERT'S TENTH PROBLEM
- Low dimensional hybrid systems -- decidable, undecidable, don't know
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Reachability problems for hierarchical piecewise constant derivative systems
- Reachability in two-clock timed automata is PSPACE-complete
- Deciding stability and mortality of piecewise affine dynamical systems
Cited In (8)
- Title not available (Why is that?)
- A Survey on Analog Models of Computation
- Title not available (Why is that?)
- On the decidability of reachability in continuous time linear time-invariant systems
- A Class of Decidable Parametric Hybrid Systems
- Reachability problems for hierarchical piecewise constant derivative systems
- Reachability and mortality problems for restricted hierarchical piecewise constant derivatives
- Mortality and Edge-to-Edge Reachability are Decidable on Surfaces
This page was built for publication: On the decidability and complexity of problems for restricted hierarchical hybrid systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q338386)
