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

DOI10.1016/J.TCS.2016.09.003MaRDI QIDQ338386zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

mortalityhybrid systemsreachability(hierarchical) piecewise constant derivativespiecewise affine maps

Mathematics Subject Classification ID

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)

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

Cites work

• scientific article; zbMATH DE number 3560737 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1263213 (Why is no real title available?)
• scientific article; zbMATH DE number 1927563 (Why is no real title available?)
• scientific article; zbMATH DE number 1444348 (Why is no real title available?)
• scientific article; zbMATH DE number 3310089 (Why is no real title available?)
• A survey of computational complexity results in systems and control
• Algorithmic analysis of polygonal hybrid systems. I: Reachability
• Computability with low-dimensional dynamical systems
• Deciding stability and mortality of piecewise affine dynamical systems
• Hybrid Systems Forming Strange Billiards
• Low dimensional hybrid systems -- decidable, undecidable, don't know
• MATRIX EQUATIONS AND HILBERT'S TENTH PROBLEM
• Mortality of Iterated Piecewise Affine Functions over the Integers: Decidability and Complexity (extended abstract)
• REACHABILITY PROBLEMS IN LOW-DIMENSIONAL ITERATIVE MAPS
• Reachability analysis of dynamical systems having piecewise-constant derivatives
• Reachability and mortality problems for restricted hierarchical piecewise constant derivatives
• Reachability in two-clock timed automata is PSPACE-complete
• Reachability problems for hierarchical piecewise constant derivative systems
• The algorithmic analysis of hybrid systems
• The mortality problem for matrices of low dimensions
• Undecidability bounds for integer matrices using Claus instances
• Updatable timed automata
• When is a pair of matrices mortal?

Cited in

(8)

• scientific article; zbMATH DE number 1303067 (Why is no real title available?)
• A Survey on Analog Models of Computation
• scientific article; zbMATH DE number 1927563 (Why is no real title available?)
• On the decidability of reachability in continuous time linear time-invariant systems
• A Class of Decidable Parametric Hybrid Systems
• Reachability and mortality problems for restricted hierarchical piecewise constant derivatives
• Reachability problems for hierarchical piecewise constant derivative systems
• 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)