The following pages link to Stefan Ratschan (Q389833):
Displayed 32 items.
- Safety verification for probabilistic hybrid systems (Q389835) (← links)
- Efficient solution of a class of quantified constraints with quantifier prefix exists-forall (Q475420) (← links)
- Set computation for nonlinear control (Q1424800) (← links)
- Quantified constraints under perturbation (Q1600045) (← links)
- Approximate quantified constraint solving by cylindrical box decomposition (Q1604710) (← links)
- Simulation based computation of certificates for safety of dynamical systems (Q1683459) (← links)
- Search heuristics for box decomposition methods (Q1862173) (← links)
- Quasi-decidability of a fragment of the first-order theory of real numbers (Q2013319) (← links)
- Fast three-valued abstract bit-vector arithmetic (Q2152654) (← links)
- Safety verification of non-linear hybrid systems is quasi-decidable (Q2248097) (← links)
- Solving reachability problems by a scalable constrained optimization method (Q2303529) (← links)
- Providing a Basin of Attraction to a Target Region of Polynomial Systems by Computation of Lyapunov-Like Functions (Q3083226) (← links)
- Satisfiability of Systems of Equations of Real Analytic Functions Is Quasi-decidable (Q3088050) (← links)
- Incremental Computation of Succinct Abstractions for Hybrid Systems (Q3172856) (← links)
- GUARANTEED TERMINATION IN THE VERIFICATION OF LTL PROPERTIES OF NON-LINEAR ROBUST DISCRETE TIME HYBRID SYSTEMS (Q3426788) (← links)
- Safety Verification of Non-linear Hybrid Systems Is Quasi-Semidecidable (Q3569093) (← links)
- Finding Errors of Hybrid Systems by Optimising an Abstraction-Based Quality Estimate (Q3637254) (← links)
- (Q4520808) (← links)
- Converse Theorems for Safety and Barrier Certificates (Q4682313) (← links)
- (Q4808717) (← links)
- Effective topological degree computation based on interval arithmetic (Q5179223) (← links)
- Convergent approximate solving of first-order constraints by approximate quantifiers (Q5277696) (← links)
- Efficient solving of quantified inequality constraints over the real numbers (Q5277761) (← links)
- Constraints for Continuous Reachability in the Verification of Hybrid Systems (Q5302913) (← links)
- Language-Based Abstraction Refinement for Hybrid System Verification (Q5452604) (← links)
- (Q5457277) (← links)
- Automated Technology for Verification and Analysis (Q5491856) (← links)
- Combined Global and Local Search for the Falsification of Hybrid Systems (Q5500561) (← links)
- Hybrid Systems: Computation and Control (Q5703953) (← links)
- Principles and Practice of Constraint Programming – CP 2003 (Q5897219) (← links)
- Railway scheduling using Boolean satisfiability modulo simulations (Q6174526) (← links)
- Solving Underdetermined Boundary Value Problems By Sequential Quadratic Programming (Q6268870) (← links)