) if you have any
comment or question regarding the papers below. For a more complete list of accepted refereed publications see my CV.
Contact me () if you have any
comment or question regarding the papers below. For a more complete list of accepted refereed publications see my CV.
Peter Franek and Stefan Ratschan and Piotr Zgliczynski
Quasi-decidability of a Fragment of the Analytic First-order Theory of Real Numbers
Submitted. Extended version
of this
paper BIB
PDF
Tomáš Dzetkulič and Stefan Ratschan
Incremental Computation of
Succinct Abstractions For Hybrid Systems
FORMATS 2011, Springer LNCS 6919
DOI PDF BIB
Tomáš Dzetkulič and Stefan Ratschan
How to Capture Hybrid Systems
Evolution Into Slices of Parallel Hyperplanes
ADHS'09: 3rd IFAC
Conference on Analysis and Design of Hybrid Systems
DOI
PDF
BIB
Stefan Ratschan
Safety
Verification of Non-linear Hybrid Systems is Quasi-decidable
PDF
(extended version
of a paper in
Proc. TAMC 2010, Springer LNCS
6108) BIB
Stefan Ratschan and Jan-Georg Smaus
Finding Errors of Hybrid Systems by Optimising an Abstraction-Based Quality Estimate
Proc. TAP: Tests and Proofs, Springer LNCS 5668, pp. 153-168, 2009
DOI PDF of
extended version BIB
Stefan Ratschan and Zhikun She
Recursive and Backward Reasoning in the Verification of Hybrid Systems
Proceedings of the 5th Int. Conf. on Informatics in Control, Automation and Robotics
(ICINCO'2008)
PDF
Martin
Fränzle, Christian Herde, Tino Teige, Stefan Ratschan, and Tobias
Schubert
Efficient Solving of Large Non-linear Arithmetic Constraint
Systems with Complex Boolean Structure
Journal on Satisfiability,
Boolean Modeling and Computation
Special Issue on SAT/CP
Integration
Volume
1, 2007, 209-236
online
PDF BIB
Henning Burchardt and Stefan Ratschan
Estimating the Region of Attraction of Ordinary Differential Equations by Quantified Constraint Solving
Proceedings of the 3rd WSEAS International Conference on DYNAMICAL SYSTEMS and CONTROL (CONTROL'07),
WSEAS Press, 2007, 241-246
PDF BIB
Stefan Ratschan and Zhikun She
Providing a Basin of Attraction to a Target Region of Polynomial Systems by Computation of Lyapunov-like
Functions
SIAM J. Control and Optimization, Volume 48, Number 7, 2010, pp. 4377-4394
DOI PDF
Stefan Ratschan and Jan-Georg Smaus
Verification-Integrated Falsification of Non-Deterministic Hybrid Systems
Proceedings of the 2nd IFAC Conference on Analysis and Design of Hybrid Systems, 2006
Postscript BIB
Stefan Ratschan and Zhikun She
Constraints for Continuous Reachability in the Verification of Hybrid Systems
Proc. 8th International Conference on artificial intelligence and symbolic computation, Springer
LNCS 4120, 196-210, 2006
DOI Postscript BIB
Werner Damm and Guilherme Pinto and Stefan Ratschan
Guaranteed Termination in the Verification of LTL Properties of Non-linear Robust Discrete Time Hybrid Systems
International Journal of Foundations of Computer Science (IJFCS), Volume 18, Number 1, 2007
DOI Postscript PDF BIB
This is a revised and extended version of an article with the same authors and name that
appeared in the proceedings of ATVA'05, Springer LNCS 3707, 2005, DOI
Stefan Ratschan and Zhikun She
Safety Verification of Hybrid Systems by Constraint Propagation Based Abstraction
Refinement
ACM Transactions in Embedded Computing Systems, Volume 6, Number
1, 2007
DOI Postscript BIB
This is a revised and extended version of an article with the same authors and name that
appeared in the proceedings of HSCC'05, Springer LNCS 3414, 2005 Springer
Stefan Ratschan
Solving Existentially Quantified Constraints with One Equality and Arbitrarily Many
Inequalities
Proc. 9th International Conference on Principles and Practice of Constaint Programming,
Springer LNCS 2833, 2003
Postscript BIB Springer
Stefan Ratschan and Josep Vehí
Robust Pole Clustering of Parametric Uncertain Systems Using Interval Methods
Robust Control Design 2003 -- Proceedings of the 4th IFAC Symposium
Patrizio Colaneri (ed.), Elsevier Science, 2004
Postscript BIB
Stefan Ratschan
Efficient Solving of Quantified Inequality Constraints over the Real Numbers
ACM Transactions on Computational Logic, Volume 7, Number 4, pp. 723-748, 2006
Original Paper Errata Postscript1 BIB
This is a revised and extended version of: Stefan Ratschan,
Continuous First-Order Constraint Satisfaction,
Artificial Intelligence, Automated Reasoning, and Symbolic Computation 2002,
Springer LNCS 2385, 2002
Stefan Ratschan
Continuous First-Order Constraint Satisfaction with Equality and Disequality Constraints
2
Proc. 8th International Conference on Principles and Practice of Constaint Programming,
Springer LNCS 2470, 2002
Postscript BIB Springer
Stefan Ratschan
Real First-Order Constraints are Stable with Probability One
Draft.
Postscript
Stefan Ratschan
Search Heuristics for Box Decomposition Methods
Journal Of Global Optimization, volume 24, number 1, 51-60, 2002
Postscript DOI BIB
Stefan Ratschan
Quantified Constraints Under Perturbation
Journal of Symbolic Computation, volume 33, number 4, 493-505, 20023
Postscript DOI BIB
Stefan Ratschan
Convergent Approximate Solving of First-Order Constraints by Approximate Quantifiers
ACM Transactions on Computational Logic.
volume 5, number 2, pages 264-281, 2004,
Postscript DOI BIB
Stefan Ratschan
Approximate Quantified Constraint Solving by Cylindrical Box Decomposition
Reliable Computing, volume 8, number 1, 2002, 21-42.
Postscript DOI BIB
Stefan Ratschan
Uncertainty Propagation in Heterogenous Algebras for Approximate Quantified Constraint Solving
Journal of Universal Computer Science, volume 6, number 9, 2000
Paper
Extended Abstract BIB
Stefan Ratschan and Luc Jaulin
Solving Composed First-Order Constraints From Discrete-Time Robust Control
Proceedings of the Sixth Annual Workshop of the ERCIM Working Group on Constraints
2001
Postscript BIB
Stefan Ratschan
Applications of Quantified Constraint Solving
Bibliography and Benchmark Problems
Online Postscript