scientific article; zbMATH DE number 1424031
From MaRDI portal
Publication:4945221
zbMath0944.68119MaRDI QIDQ4945221
Publication date: 23 March 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Verification of Hybrid Systems, Discrete semantics for hybrid automata. Avoiding misleading assumptions in systems biology, Computation with perturbed dynamical systems, Robustness, Scott continuity, and computability, \(\epsilon\)-semantics computations on biological systems, Robust reachability in timed automata and games: a game-based approach, Taylor approximation for hybrid systems, Relating syntactic and semantic perturbations of hybrid automata, Safety verification of non-linear hybrid systems is quasi-decidable, Monotonic hybrid systems, Quasi-decidability of a fragment of the first-order theory of real numbers, How much can analog and hybrid systems be proved (super-)Turing, Challenges in Constraint-Based Analysis of Hybrid Systems, Safe \& robust reachability analysis of hybrid systems, Inclusion dynamics hybrid automata, Language-Based Abstraction Refinement for Hybrid System Verification, Robustness of temporal logic specifications for continuous-time signals, Computable analysis with applications to dynamic systems, Towards physical hybrid systems, Robust safety of timed automata, Computing differential invariants of hybrid systems as fixed points, Differential dynamic logic for hybrid systems, Continuity and computability of reachable sets, Approximate equivalence of the hybrid automata with Taylor theory
