Low dimensional hybrid systems -- decidable, undecidable, don't know
From MaRDI portal
(Redirected from Publication:418141)
Recommendations
Cites work
- scientific article; zbMATH DE number 1670795 (Why is no real title available?)
- scientific article; zbMATH DE number 3836945 (Why is no real title available?)
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 44378 (Why is no real title available?)
- scientific article; zbMATH DE number 3466189 (Why is no real title available?)
- scientific article; zbMATH DE number 3484411 (Why is no real title available?)
- scientific article; zbMATH DE number 3492552 (Why is no real title available?)
- scientific article; zbMATH DE number 1263213 (Why is no real title available?)
- scientific article; zbMATH DE number 1303058 (Why is no real title available?)
- scientific article; zbMATH DE number 1096865 (Why is no real title available?)
- scientific article; zbMATH DE number 1927563 (Why is no real title available?)
- scientific article; zbMATH DE number 1507210 (Why is no real title available?)
- scientific article; zbMATH DE number 1759410 (Why is no real title available?)
- scientific article; zbMATH DE number 1794363 (Why is no real title available?)
- scientific article; zbMATH DE number 1444368 (Why is no real title available?)
- scientific article; zbMATH DE number 3310089 (Why is no real title available?)
- A theory of timed automata
- Algorithmic algebraic model checking. III: Approximate methods
- Bisimulation relations for dynamical, control, and hybrid systems
- Closed-form analytic maps in one and two dimensions can simulate universal Turing machines
- Computability with low-dimensional dynamical systems
- Computation in One-Dimensional Piecewise Maps
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- On some relations between dynamical systems and transition systems
- Parametric real-time reasoning
- REACHABILITY PROBLEMS IN LOW-DIMENSIONAL ITERATIVE MAPS
- Reachability analysis of dynamical systems having piecewise-constant derivatives
- Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
- The algorithmic analysis of hybrid systems
- Timed automata and additive clock constraints
- Universal computation and other capabilities of hybrid and continuous dynamical systems
- Unpredictability and undecidability in dynamical systems
Cited in
(13)- Limit cycle analysis of a class of hybrid gene regulatory networks
- scientific article; zbMATH DE number 1303067 (Why is no real title available?)
- A Survey on Analog Models of Computation
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- A survey of challenges for runtime verification from advanced application domains (beyond software)
- What's decidable about parametric timed automata?
- Reachability analysis of a class of hybrid gene regulatory networks
- scientific article; zbMATH DE number 1927563 (Why is no real title available?)
- On the decidability and complexity of problems for restricted hierarchical hybrid systems
- Reachability problems for one-dimensional piecewise affine maps
- On the decidability of reachability in continuous time linear time-invariant systems
- A Class of Decidable Parametric Hybrid Systems
- 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)