scientific article; zbMATH DE number 1424031
From MaRDI portal
Recommendations
Cited in
(29)- Robust safety of timed automata
- Computing differential invariants of hybrid systems as fixed points
- Differential dynamic logic for hybrid systems
- Safe \& robust reachability analysis of hybrid systems
- Quasi-decidability of a fragment of the first-order theory of real numbers
- Safety verification of non-linear hybrid systems is quasi-decidable
- Towards physical hybrid systems
- Approximate equivalence of the hybrid automata with Taylor theory
- \(\epsilon\)-semantics computations on biological systems
- Taylor approximation for hybrid systems
- Monotonic hybrid systems
- How much can analog and hybrid systems be proved (super-)Turing
- Continuity and computability of reachable sets
- Verification of Hybrid Systems
- Computation with perturbed dynamical systems
- Safety verification of non-linear hybrid systems is quasi-semidecidable
- Robust reachability in timed automata and games: a game-based approach
- Relating syntactic and semantic perturbations of hybrid automata
- Challenges in Constraint-Based Analysis of Hybrid Systems
- Computable analysis with applications to dynamic systems
- Language-Based Abstraction Refinement for Hybrid System Verification
- scientific article; zbMATH DE number 2242595 (Why is no real title available?)
- The demon, the gambler, and the engineer. Reconciling hybrid-system theory with metrology
- Robustness, Scott continuity, and computability
- Quantifiying the robustness of dynamical systems. Relating time and space to length and precision
- Robustness of temporal logic specifications for continuous-time signals
- Quantifying the robustness of dynamical systems. Relating time and space to length and precision
- Discrete semantics for hybrid automata. Avoiding misleading assumptions in systems biology
- Inclusion dynamics hybrid automata
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4945221)
