On some relations between dynamical systems and transition systems

DOI10.1007/3-540-58201-0_58zbMath1418.68088OpenAlexW1529890132MaRDI QIDQ4632416

Eugene Asarin, Oded Maler

Publication date: 29 April 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-58201-0_58

zbMATH Keywords

hybrid systemTuring machinetransition systemoutput portinput port

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Algorithmic analysis of polygonal hybrid systems. I: Reachability, On the computational power of dynamical systems and hybrid systems, Complexity of reachability problems for finite discrete dynamical systems, Reachability analysis of dynamical systems having piecewise-constant derivatives, Some bounds on the computational power of piecewise constant derivative systems (extended abstract), Reachability problems for sequential dynamical systems with threshold functions., Low dimensional hybrid systems -- decidable, undecidable, don't know, Achilles and the tortoise climbing up the hyper-arithmetical hierarchy, Analog computation with dynamical systems

Cites Work

• From ATP to timed graphs and hybrid systems
• Decidable integration graphs.
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item