Low dimensional hybrid systems -- decidable, undecidable, don't know
From MaRDI portal
Publication:418141
DOI10.1016/j.ic.2011.11.006zbMath1279.68127OpenAlexW2020140696MaRDI QIDQ418141
Eugene Asarin, Gerardo Schneider, Amir Pnueli, Venkatesh P. Mysore
Publication date: 24 May 2012
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2011.11.006
undecidabilityhybrid systems(hierarchical) piece-wise constant derivative systemspiece-wise affine maps
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (8)
Reachability Problems for One-Dimensional Piecewise Affine Maps ⋮ On the decidability and complexity of problems for restricted hierarchical hybrid systems ⋮ Mortality and Edge-to-Edge Reachability are Decidable on Surfaces ⋮ On the decidability of reachability in continuous time linear time-invariant systems ⋮ A survey of challenges for runtime verification from advanced application domains (beyond software) ⋮ What’s Decidable About Parametric Timed Automata? ⋮ A Survey on Analog Models of Computation ⋮ Limit cycle analysis of a class of hybrid gene regulatory networks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The algorithmic analysis of hybrid systems
- Universal computation and other capabilities of hybrid and continuous dynamical systems
- Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
- Closed-form analytic maps in one and two dimensions can simulate universal Turing machines
- A theory of timed automata
- Computability with low-dimensional dynamical systems
- Reachability analysis of dynamical systems having piecewise-constant derivatives
- Timed automata and additive clock constraints
- Bisimulation relations for dynamical, control, and hybrid systems
- REACHABILITY PROBLEMS IN LOW-DIMENSIONAL ITERATIVE MAPS
- Computation in One-Dimensional Piecewise Maps
- Unpredictability and undecidability in dynamical systems
- On some relations between dynamical systems and transition systems
- Parametric real-time reasoning
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
This page was built for publication: Low dimensional hybrid systems -- decidable, undecidable, don't know