Reachability analysis of dynamical systems having piecewise-constant derivatives
From MaRDI portal
Publication:1367528
Recommendations
- Reachability problems for hierarchical piecewise constant derivative systems
- On the complexity of bounded time reachability for piecewise affine systems
- On the complexity of bounded time and precision reachability for piecewise affine systems
- Decidable hybrid systems
- Reachability and mortality problems for restricted hierarchical piecewise constant derivatives
Cites work
- scientific article; zbMATH DE number 512843 (Why is no real title available?)
- scientific article; zbMATH DE number 4120061 (Why is no real title available?)
- scientific article; zbMATH DE number 3804333 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- A theory of timed automata
- Computability and complexity of ray tracing
- Model-checking in dense real-time
- On some relations between dynamical systems and transition systems
- Symbolic model checking for real-time systems
- Universal computation and other capabilities of hybrid and continuous dynamical systems
Cited in
(78)- Reachability analysis of a class of hybrid gene regulatory networks
- Computing Omega-Limit Sets in Linear Dynamical Systems
- Deciding concurrent planar monotonic linear hybrid systems
- Reachability analysis of non-linear planar autonomous systems
- Modelling hybrid production systems through the ACD specification: a case study in the fibre-glass industry
- On the decidability of reachability in continuous time linear time-invariant systems
- Timed automata verification and synthesis via finite automata learning
- scientific article; zbMATH DE number 3856905 (Why is no real title available?)
- An RNA-based theory of natural universal computation
- scientific article; zbMATH DE number 3234735 (Why is no real title available?)
- Piecewise constant systems representing classes of Lyapunov equivalent systems
- Tight space-noise tradeoffs in computing the ergodic measure
- On the complexity of bounded time reachability for piecewise affine systems
- Reachability problems for one-dimensional piecewise affine maps
- Decidable integration graphs.
- A decidable class of planar linear hybrid systems
- Computational bounds on polynomial differential equations
- Reachability of Uncertain Nonlinear Systems Using a Nonlinear Hybridization
- Deciding stability and mortality of piecewise affine dynamical systems
- What is a universal computing machine?
- Continuity and computability of reachable sets
- Achilles and the tortoise climbing up the arithmetical hierarchy
- REACHABILITY PROBLEMS IN LOW-DIMENSIONAL ITERATIVE MAPS
- Achilles and the tortoise climbing up the hyper-arithmetical hierarchy
- Reachability in Linear Dynamical Systems
- Algorithmic analysis of polygonal hybrid systems. I: Reachability
- Reachability analysis of linear dynamic systems with constant, arbitrary, and Lipschitz continuous inputs
- Cyclic linear differential automata: A simple class of hybrid dynamical systems
- On the complexity of bounded time and precision reachability for piecewise affine systems
- Discrete-time hybrid modeling and verification of the batch evaporator process benchmark
- Span-reachability and observability of bilinear hybrid systems
- Hybridization methods for the analysis of nonlinear systems
- Tracking differentiable trajectories across polyhedra boundaries
- Continuous Petri nets: expressive power and decidability issues
- Boundedness of the domain of definition is undecidable for polynomial ODEs
- Interrupt timed automata: verification and expressiveness
- Reachability Analysis of Nonlinear Differential-Algebraic Systems
- Some bounds on the computational power of piecewise constant derivative systems
- Regularizability of complex switched server queueing networks modelled as hybrid dynamical systems
- Computation with perturbed dynamical systems
- Some decidable results on reachability of solvable systems
- Low dimensional hybrid systems -- decidable, undecidable, don't know
- Limit cycle analysis of a class of hybrid gene regulatory networks
- How much can analog and hybrid systems be proved (super-)Turing
- A survey of computational complexity results in systems and control
- Interrupt Timed Automata
- A supervisory control method for ensuring the conformance of real-time discrete event systems
- Computing reachable sets for uncertain nonlinear monotone systems
- Verification of Hybrid Systems
- Approximating Continuous Systems by Timed Automata
- Updatable Timed Automata with Additive and Diagonal Constraints
- Computation in gene networks
- Tracking smooth trajectories in linear hybrid systems
- Complexity of reachability problems for finite discrete dynamical systems
- ParaPlan: a tool for parallel reachability analysis of planar polygonal differential inclusion systems
- Reachability analysis of rational eigenvalue linear systems
- Closed-form analytic maps in one and two dimensions can simulate universal Turing machines
- Timed-automata abstraction of switched dynamical systems using control invariants
- Computability and dynamical systems
- Timed-automata abstraction of switched dynamical systems using control funnels
- Computing reachable sets for uncertain nonlinear hybrid systems using interval constraint-propagation techniques
- PuRSUE -- from specification of robotic environments to synthesis of controllers
- Perfect simulation of a class of stochastic hybrid systems with an application to peer to peer systems
- Computable analysis with applications to dynamic systems
- Timed discrete event control of parallel production lines with continuous outputs
- On the computational power of dynamical systems and hybrid systems
- A theory of complexity for continuous time systems
- The stability of saturated linear dynamical systems is undecidable
- Polynomial interrupt timed automata: verification and expressiveness
- Reachability problems for hierarchical piecewise constant derivative systems
- The transitivity problem of Turing machines
- On the decidability and complexity of problems for restricted hierarchical hybrid systems
- A Survey on Analog Models of Computation
- Reachability and mortality problems for restricted hierarchical piecewise constant derivatives
- Supervisory control and reactive synthesis: a comparative introduction
- STORMED Hybrid Systems
- Deciding reachability for 3-dimensional multi-linear systems
- A survey of challenges for runtime verification from advanced application domains (beyond software)
This page was built for publication: Reachability analysis of dynamical systems having piecewise-constant derivatives
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1367528)
