Low dimensional hybrid systems -- decidable, undecidable, don't know

DOI10.1016/J.IC.2011.11.006zbMATH Open1279.68127OpenAlexW2020140696MaRDI QIDQ418141FDOQ418141

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

Recommendations

• scientific article; zbMATH DE number 1927563
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• Reachability Problems for Hybrid Automata
• scientific article; zbMATH DE number 1303067
• A decidable class of planar linear hybrid systems

zbMATH Keywords

hybrid systemsundecidability(hierarchical) piece-wise constant derivative systemspiece-wise affine maps

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Topological dynamics (37B99)

Cites Work

• A theory of timed automata
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• The algorithmic analysis of hybrid systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Computability with low-dimensional dynamical systems
• Reachability analysis of dynamical systems having piecewise-constant derivatives
• REACHABILITY PROBLEMS IN LOW-DIMENSIONAL ITERATIVE MAPS
• Title not available (Why is that?)
• Title not available (Why is that?)
• Closed-form analytic maps in one and two dimensions can simulate universal Turing machines
• Unpredictability and undecidability in dynamical systems
• Universal computation and other capabilities of hybrid and continuous dynamical systems
• Parametric real-time reasoning
• Timed automata and additive clock constraints
• Bisimulation relations for dynamical, control, and hybrid systems
• Title not available (Why is that?)
• Algorithmic algebraic model checking. III: Approximate methods
• Computation in One-Dimensional Piecewise Maps
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On some relations between dynamical systems and transition systems
• Title not available (Why is that?)
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science

Cited In (12)

• Limit cycle analysis of a class of hybrid gene regulatory networks
• Title not available (Why is that?)
• A Survey on Analog Models of Computation
• A survey of challenges for runtime verification from advanced application domains (beyond software)
• Reachability analysis of a class of hybrid gene regulatory networks
• Title not available (Why is that?)
• On the decidability and complexity of problems for restricted hierarchical hybrid systems
• On the decidability of reachability in continuous time linear time-invariant systems
• A Class of Decidable Parametric Hybrid Systems
• What’s Decidable About Parametric Timed Automata?
• Reachability Problems for One-Dimensional Piecewise Affine Maps
• Mortality and Edge-to-Edge Reachability are Decidable on Surfaces

This page was built for publication: Low dimensional hybrid systems -- decidable, undecidable, don't know

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q418141)