On the decidability and complexity of problems for restricted hierarchical hybrid systems

DOI10.1016/j.tcs.2016.09.003zbMath1353.68158OpenAlexW2520428934MaRDI QIDQ338386

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

zbMATH Keywords

hybrid systemsreachabilitymortality(hierarchical) piecewise constant derivativespiecewise affine maps

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30)

Related Items (3)

Mortality and Edge-to-Edge Reachability are Decidable on Surfaces ⋮ On the decidability of reachability in continuous time linear time-invariant systems ⋮ A Survey on Analog Models of Computation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• When is a pair of matrices mortal?
• Low dimensional hybrid systems -- decidable, undecidable, don't know
• The algorithmic analysis of hybrid systems
• Computability with low-dimensional dynamical systems
• Reachability analysis of dynamical systems having piecewise-constant derivatives
• The mortality problem for matrices of low dimensions
• Updatable timed automata
• 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
• UNDECIDABILITY BOUNDS FOR INTEGER MATRICES USING CLAUS INSTANCES
• Reachability and Mortality Problems for Restricted Hierarchical Piecewise Constant Derivatives
• REACHABILITY PROBLEMS IN LOW-DIMENSIONAL ITERATIVE MAPS
• MATRIX EQUATIONS AND HILBERT'S TENTH PROBLEM
• Reachability Problems for Hierarchical Piecewise Constant Derivative Systems
• Reachability in Two-Clock Timed Automata Is PSPACE-Complete
• A survey of computational complexity results in systems and control
• Deciding stability and mortality of piecewise affine dynamical systems

This page was built for publication: On the decidability and complexity of problems for restricted hierarchical hybrid systems