Stefan Ratschan

According to our database, Stefan Ratschan authored at least 48 papers between 2000 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of four.

2024

Computation of feedback control laws based on switched tracking of demonstrations.

Jirí Fejlek, Stefan Ratschan

Eur. J. Control, 2024

Multi-Agent Path Finding with Continuous Time Using SAT Modulo Linear Real Arithmetic.

Tomás Kolárik, Stefan Ratschan, Pavel Surynek

Proceedings of the 16th International Conference on Agents and Artificial Intelligence, 2024

2023

Satisfiability of Non-linear Transcendental Arithmetic as a Certificate Search Problem.

Enrico Lipparini, Stefan Ratschan

Proceedings of the NASA Formal Methods - 15th International Symposium, 2023

Deciding Predicate Logical Theories Of Real-Valued Functions.

Stefan Ratschan

Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

LQR-Trees with Sampling Based Exploration of the State Space.

Jirí Fejlek, Stefan Ratschan

IROS, 2023

Railway Scheduling Using Boolean Satisfiability Modulo Simulations.

Tomás Kolárik, Stefan Ratschan

Proceedings of the Formal Methods - 25th International Symposium, 2023

2022

Fast Three-Valued Abstract Bit-Vector Arithmetic.

Jan Onderka, Stefan Ratschan

Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2022

Computing Funnels Using Numerical Optimization Based Falsifiers.

Jirí Fejlek, Stefan Ratschan

Proceedings of the 2022 International Conference on Robotics and Automation, 2022

2020

Computation of Stabilizing and Relatively Optimal Feedback Control Laws Based on Demonstrations.

Jirí Fejlek, Stefan Ratschan

CoRR, 2020

SAT Modulo Differential Equation Simulations.

Tomás Kolárik, Stefan Ratschan

Proceedings of the Tests and Proofs - 14th International Conference, 2020

2018

Converse Theorems for Safety and Barrier Certificates.

Stefan Ratschan

IEEE Trans. Autom. Control., 2018

2017

A Robust Finite-Time Converse Theorem for Inductive Safety Certificates of Ordinary Differential Equations.

Stefan Ratschan

CoRR, 2017

Simulation Based Computation of Certificates for Safety of Dynamical Systems.

Stefan Ratschan

Proceedings of the Formal Modeling and Analysis of Timed Systems, 2017

2016

Quasi-decidability of a Fragment of the First-Order Theory of Real Numbers.

Peter Franek, Stefan Ratschan, Piotr Zgliczynski

J. Autom. Reason., 2016

2015

Effective topological degree computation based on interval arithmetic.

Peter Franek, Stefan Ratschan

Math. Comput., 2015

2014

Efficient Solution of a Class of Quantified Constraints with Quantifier Prefix Exists-Forall.

Milan Hladík, Stefan Ratschan

Math. Comput. Sci., 2014

Safety verification of non-linear hybrid systems is quasi-decidable.

Stefan Ratschan

Formal Methods Syst. Des., 2014

Combined Global and Local Search for the Falsification of Hybrid Systems.

Jan Kurátko, Stefan Ratschan

Proceedings of the Formal Modeling and Analysis of Timed Systems, 2014

2012

Foreword.

Stefan Ratschan, Thomas Sturm

Math. Comput. Sci., 2012

Safety Verification for Probabilistic Hybrid Systems.

Lijun Zhang, Zhikun She, Stefan Ratschan, Holger Hermanns, Ernst Moritz Hahn

Eur. J. Control, 2012

Applications of Quantified Constraint Solving over the Reals - Bibliography

Stefan Ratschan

CoRR, 2012

2011

Foreword.

Georgios Fainekos, Eric Goubault, Sylvie Putot, Stefan Ratschan

Math. Comput. Sci., 2011

Satisfiability of Systems of Equations of Real Analytic Functions Is Quasi-decidable.

Peter Franek, Stefan Ratschan, Piotr Zgliczynski

Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

Incremental Computation of Succinct Abstractions for Hybrid Systems.

Tomás Dzetkulic, Stefan Ratschan

Proceedings of the Formal Modeling and Analysis of Timed Systems, 2011

2010

Providing a Basin of Attraction to a Target Region of Polynomial Systems by Computation of Lyapunov-Like Functions.

Stefan Ratschan, Zhikun She

SIAM J. Control. Optim., 2010

Safety Verification of Non-linear Hybrid Systems Is Quasi-Semidecidable.

Stefan Ratschan

Proceedings of the Theory and Applications of Models of Computation, 7th Annual Conference, 2010

2009

Finding Errors of Hybrid Systems by Optimising an Abstraction-Based Quality Estimate.

Stefan Ratschan, Jan-Georg Smaus

Proceedings of the Tests and Proofs - 3rd International Conference, 2009

Symbolic-numeric problems in the automatic analysis and verification of cyber-physical systems.

Stefan Ratschan

Proceedings of the Symbolic Numeric Computation, 2009

How to Capture Hybrid Systems Evolution Into Slices of Parallel Hyperplanes.

Tomás Dzetkulic, Stefan Ratschan

Proceedings of the 3rd IFAC Conference on Analysis and Design of Hybrid Systems, 2009

2008

Recursive and Backward Reasoning in the Verification on Hybrid Systems.

Stefan Ratschan, Zhikun She

Proceedings of the ICINCO 2008, 2008

2007

Safety verification of hybrid systems by constraint propagation-based abstraction refinement.

Stefan Ratschan, Zhikun She

ACM Trans. Embed. Comput. Syst., 2007

Efficient Solving of Large Non-linear Arithmetic Constraint Systems with Complex Boolean Structure.

Martin Fränzle, Christian Herde, Tino Teige, Stefan Ratschan, Tobias Schubert

J. Satisf. Boolean Model. Comput., 2007

Guaranteed Termination in the Verification of Ltl Properties of Non-linear Robust Discrete Time Hybrid Systems.

Werner Damm, Guilherme Pinto, Stefan Ratschan

Int. J. Found. Comput. Sci., 2007

Language-Based Abstraction Refinement for Hybrid System Verification.

Felix Klaedtke, Stefan Ratschan, Zhikun She

Proceedings of the Verification, 2007

2006

Efficient solving of quantified inequality constraints over the real numbers.

Stefan Ratschan

ACM Trans. Comput. Log., 2006

Constraints for Continuous Reachability in the Verification of Hybrid Systems.

Stefan Ratschan, Zhikun She

Proceedings of the Artificial Intelligence and Symbolic Computation, 2006

Verification-Integrated Falsification of non-Deterministic Hybrid Systems.

Stefan Ratschan, Jan-Georg Smaus

Proceedings of the 2nd IFAC Conference on Analysis and Design of Hybrid Systems, 2006

2005

Solving Undecidable Problems in the Theory of Real Numbers and Hybrid Systems.

Stefan Ratschan

Proceedings of the Algorithmic Algebra and Logic. Proceedings of the A3L 2005, 2005

2004

Convergent approximate solving of first-order constraints by approximate quantifiers.

Stefan Ratschan

ACM Trans. Comput. Log., 2004

Set Computation for Nonlinear Control.

Luc Jaulin, Stefan Ratschan, Laurent Hardouin

Reliab. Comput., 2004

2003

Solving Existentially Quantified Constraints with One Equality and Arbitrarily Many Inequalities.

Stefan Ratschan

Proceedings of the Principles and Practice of Constraint Programming, 2003

2002

Approximate Quantified Constraint Solving by Cylindrical Box Decomposition.

Stefan Ratschan

Reliab. Comput., 2002

Quantified Constraints Under Perturbation.

Stefan Ratschan

J. Symb. Comput., 2002

Search Heuristics for Box Decomposition Methods.

Stefan Ratschan

J. Glob. Optim., 2002

Continuous First-Order Constraint Satisfactionwith Equality and Disequality Constraints.

Stefan Ratschan

Proceedings of the Principles and Practice of Constraint Programming, 2002

Continuous First-Order Constraint Satisfaction.

Stefan Ratschan

Proceedings of the Artificial Intelligence, 2002

2001

Solving Composed First-Order Constraints from Discrete-Time Robust Control

Stefan Ratschan, Luc Jaulin

CoRR, 2001

2000

Uncertainty Propagation in Heterogeneous Algebras for Approximate Quantified Constraint Solving.

Stefan Ratschan

J. Univers. Comput. Sci., 2000