Reachability analysis of dynamical systems having piecewise-constant derivatives

DOI10.1016/0304-3975(94)00228-BzbMATH Open0884.68050MaRDI QIDQ1367528FDOQ1367528

Amir Pnueli, Eugene Asarin, Oded Maler

Publication date: 29 September 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

dynamical systemsreachabilityPCD systemspiecewise-constant derivatives

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Controllability (93B05)

Cites Work

• A theory of timed automata
• Computability and complexity of ray tracing
• Title not available (Why is that?)
• Model-checking in dense real-time
• Symbolic model checking for real-time systems
• Title not available (Why is that?)
• Universal computation and other capabilities of hybrid and continuous dynamical systems
• On some relations between dynamical systems and transition systems
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (72)

• Some decidable results on reachability of solvable systems
• Computability and Dynamical Systems
• Algorithmic analysis of polygonal hybrid systems. I: Reachability
• Computing reachable sets for uncertain nonlinear hybrid systems using interval constraint-propagation techniques
• PuRSUE -- from specification of robotic environments to synthesis of controllers
• Cyclic linear differential automata: A simple class of hybrid dynamical systems
• Interrupt timed automata: verification and expressiveness
• Limit cycle analysis of a class of hybrid gene regulatory networks
• Reachability of Uncertain Nonlinear Systems Using a Nonlinear Hybridization
• Reachability in Linear Dynamical Systems
• CONTINUOUS PETRI NETS: EXPRESSIVE POWER AND DECIDABILITY ISSUES
• An RNA-based theory of natural universal computation
• Timed-Automata Abstraction of Switched Dynamical Systems Using Control Funnels
• Reachability Analysis of Nonlinear Differential-Algebraic Systems
• A Survey on Analog Models of Computation
• Computational bounds on polynomial differential equations
• Span-reachability and observability of bilinear hybrid systems
• Some bounds on the computational power of piecewise constant derivative systems (extended abstract)
• Regularizability of complex switched server queueing networks modelled as hybrid dynamical systems
• The stability of saturated linear dynamical systems is undecidable
• On the computational power of dynamical systems and hybrid systems
• Supervisory control and reactive synthesis: a comparative introduction
• Continuity and computability of reachable sets
• REACHABILITY PROBLEMS IN LOW-DIMENSIONAL ITERATIVE MAPS
• Reachability analysis of linear dynamic systems with constant, arbitrary, and Lipschitz continuous inputs
• A survey of challenges for runtime verification from advanced application domains (beyond software)
• Hybridization methods for the analysis of nonlinear systems
• A survey of computational complexity results in systems and control
• A supervisory control method for ensuring the conformance of real-time discrete event systems
• The Transitivity Problem of Turing Machines
• A decidable class of planar linear hybrid systems
• Title not available (Why is that?)
• Verification of Hybrid Systems
• How much can analog and hybrid systems be proved (super-)Turing
• Piecewise constant systems representing classes of Lyapunov equivalent systems
• On the decidability and complexity of problems for restricted hierarchical hybrid systems
• Tight space-noise tradeoffs in computing the ergodic measure
• Achilles and the tortoise climbing up the hyper-arithmetical hierarchy
• Low dimensional hybrid systems -- decidable, undecidable, don't know
• What is a universal computing machine?
• STORMED Hybrid Systems
• Deciding stability and mortality of piecewise affine dynamical systems
• Interrupt Timed Automata
• Approximating Continuous Systems by Timed Automata
• Updatable Timed Automata with Additive and Diagonal Constraints
• Complexity of reachability problems for finite discrete dynamical systems
• Decidable integration graphs.
• Computing reachable sets for uncertain nonlinear monotone systems
• Computable analysis with applications to dynamic systems
• Computation with perturbed dynamical systems
• Computation in gene networks
• Reachability analysis of rational eigenvalue linear systems
• Polynomial interrupt timed automata: verification and expressiveness
• Achilles and the tortoise climbing up the arithmetical hierarchy
• On the complexity of bounded time and precision reachability for piecewise affine systems
• Timed-automata abstraction of switched dynamical systems using control invariants
• Perfect simulation of a class of stochastic hybrid systems with an application to peer to peer systems
• Timed discrete event control of parallel production lines with continuous outputs
• Reachability Problems for One-Dimensional Piecewise Affine Maps
• Discrete-time hybrid modeling and verification of the batch evaporator process benchmark
• Closed-form analytic maps in one and two dimensions can simulate universal Turing machines
• On The Complexity of Bounded Time Reachability for Piecewise Affine Systems
• A theory of complexity for continuous time systems
• Boundedness of the Domain of Definition is Undecidable for Polynomial ODEs
• Deciding Concurrent Planar Monotonic Linear Hybrid Systems
• Reachability analysis of a class of hybrid gene regulatory networks
• Modelling hybrid production systems through the ACD specification: a case study in the fibre-glass industry
• Computing Omega-Limit Sets in Linear Dynamical Systems
• On the decidability of reachability in continuous time linear time-invariant systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Timed automata verification and synthesis via finite automata learning

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)