A note on the undecidability of the reachability problem for o-minimal dynamical systems

DOI10.1002/malq.200510024zbMath1089.03035OpenAlexW2154019387MaRDI QIDQ5469108

Thomas Brihaye

Publication date: 16 May 2006

Published in: MLQ (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.200510024

zbMATH Keywords

reachability problemBSS model of computationgeneral o-minimal dynamical systemsTuring-undecidability

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Model theory of ordered structures; o-minimality (03C64)

Related Items (3)

Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets ⋮ Unnamed Item ⋮ Formal language properties of hybrid systems with strong resets

Cites Work

• Hybrid Systems: Computation and Control
• Computer Science Logic
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on the undecidability of the reachability problem for o-minimal dynamical systems