The following pages link to (Q4945221):
Displaying 24 items.
- Computation with perturbed dynamical systems (Q355515) (← links)
- Robust reachability in timed automata and games: a game-based approach (Q481098) (← links)
- Robustness of temporal logic specifications for continuous-time signals (Q732015) (← links)
- Discrete semantics for hybrid automata. Avoiding misleading assumptions in systems biology (Q843992) (← links)
- Inclusion dynamics hybrid automata (Q999262) (← links)
- Robust safety of timed automata (Q1028728) (← links)
- Computing differential invariants of hybrid systems as fixed points (Q1039853) (← links)
- Differential dynamic logic for hybrid systems (Q1040772) (← links)
- Safe \& robust reachability analysis of hybrid systems (Q1786614) (← links)
- Quasi-decidability of a fragment of the first-order theory of real numbers (Q2013319) (← links)
- Safety verification of non-linear hybrid systems is quasi-decidable (Q2248097) (← links)
- Towards physical hybrid systems (Q2305415) (← links)
- Approximate equivalence of the hybrid automata with Taylor theory (Q2336779) (← links)
- \(\epsilon\)-semantics computations on biological systems (Q2453211) (← links)
- Taylor approximation for hybrid systems (Q2461793) (← links)
- Monotonic hybrid systems (Q2486564) (← links)
- How much can analog and hybrid systems be proved (super-)Turing (Q2497875) (← links)
- Continuity and computability of reachable sets (Q2566008) (← links)
- Verification of Hybrid Systems (Q3176388) (← links)
- Relating syntactic and semantic perturbations of hybrid automata (Q5009441) (← links)
- Challenges in Constraint-Based Analysis of Hybrid Systems (Q5191406) (← links)
- Computable analysis with applications to dynamic systems (Q5220187) (← links)
- Language-Based Abstraction Refinement for Hybrid System Verification (Q5452604) (← links)
- Robustness, Scott continuity, and computability (Q6190407) (← links)
