default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStefan Ratschan
Person information
- affiliation: Academy of Sciences of the Czech Republic, Praha, Czech Republic
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j20]Jirí Fejlek, Stefan Ratschan:
Computation of feedback control laws based on switched tracking of demonstrations. Eur. J. Control 80: 101118 (2024)- [c27]Tomás Kolárik, Stefan Ratschan, Pavel Surynek:
Multi-Agent Path Finding with Continuous Time Using SAT Modulo Linear Real Arithmetic. ICAART (1) 2024: 47-58 - 2023
- [c26]Tomás Kolárik
, Stefan Ratschan:
Railway Scheduling Using Boolean Satisfiability Modulo Simulations. FM 2023: 56-73 - [c25]Jirí Fejlek, Stefan Ratschan:
LQR-Trees with Sampling Based Exploration of the State Space. IROS 2023: 4777-4782 - [c24]Stefan Ratschan:
Deciding Predicate Logical Theories Of Real-Valued Functions. MFCS 2023: 76:1-76:15 - [c23]Enrico Lipparini, Stefan Ratschan:
Satisfiability of Non-linear Transcendental Arithmetic as a Certificate Search Problem. NFM 2023: 472-488 - [i17]Jirí Fejlek, Stefan Ratschan:
LQR-trees with Sampling Based Exploration of the State Space. CoRR abs/2303.00553 (2023) - [i16]Enrico Lipparini, Stefan Ratschan:
Satisfiability of Non-Linear Transcendental Arithmetic as a Certificate Search Problem. CoRR abs/2303.16582 (2023) - [i15]Stefan Ratschan:
Deciding Predicate Logical Theories of Real-Valued Functions. CoRR abs/2306.16505 (2023) - [i14]Tomás Kolárik, Stefan Ratschan, Pavel Surynek:
Multi-Agent Path Finding with Continuous Time Using SAT Modulo Linear Real Arithmetic. CoRR abs/2312.08051 (2023) - 2022
- [c22]Jirí Fejlek, Stefan Ratschan:
Computing Funnels Using Numerical Optimization Based Falsifiers. ICRA 2022: 4318-4324 - [c21]Jan Onderka, Stefan Ratschan:
Fast Three-Valued Abstract Bit-Vector Arithmetic. VMCAI 2022: 242-262 - [i13]Tomás Kolárik, Stefan Ratschan:
Railway Scheduling Using Boolean Satisfiability Modulo Simulations. CoRR abs/2212.05382 (2022) - 2021
- [e1]Thao Dang, Stefan Ratschan:
Proceedings 6th International Workshop on Symbolic-Numeric methods for Reasoning about CPS and IoT, SNR 2020, online, 31 August 2020. EPTCS 331, 2021 [contents] - [i12]Jirí Fejlek, Stefan Ratschan:
Computing Funnels Using Numerical Optimization Based Falsifiers. CoRR abs/2109.11420 (2021) - 2020
- [c20]Tomás Kolárik, Stefan Ratschan:
SAT Modulo Differential Equation Simulations. TAP@STAF 2020: 80-99 - [i11]Jirí Fejlek, Stefan Ratschan:
Computation of Stabilizing and Relatively Optimal Feedback Control Laws Based on Demonstrations. CoRR abs/2011.12639 (2020)
2010 – 2019
- 2018
- [j19]Stefan Ratschan:
Converse Theorems for Safety and Barrier Certificates. IEEE Trans. Autom. Control. 63(8): 2628-2632 (2018) - 2017
- [c19]Stefan Ratschan:
Simulation Based Computation of Certificates for Safety of Dynamical Systems. FORMATS 2017: 303-317 - [i10]Stefan Ratschan:
A Robust Finite-Time Converse Theorem for Inductive Safety Certificates of Ordinary Differential Equations. CoRR abs/1701.03948 (2017) - [i9]Stefan Ratschan:
Simulation Based Computation of Certificates for Safety of Dynamical Systems. CoRR abs/1707.00879 (2017) - 2016
- [j18]Peter Franek, Stefan Ratschan, Piotr Zgliczynski:
Quasi-decidability of a Fragment of the First-Order Theory of Real Numbers. J. Autom. Reason. 57(2): 157-185 (2016) - 2015
- [j17]Peter Franek, Stefan Ratschan:
Effective topological degree computation based on interval arithmetic. Math. Comput. 84(293): 1265-1290 (2015) - 2014
- [j16]Stefan Ratschan:
Safety verification of non-linear hybrid systems is quasi-decidable. Formal Methods Syst. Des. 44(1): 71-90 (2014) - [j15]Milan Hladík, Stefan Ratschan:
Efficient Solution of a Class of Quantified Constraints with Quantifier Prefix Exists-Forall. Math. Comput. Sci. 8(3-4): 329-340 (2014) - [c18]Jan Kurátko, Stefan Ratschan:
Combined Global and Local Search for the Falsification of Hybrid Systems. FORMATS 2014: 146-160 - [i8]Jan Kurátko, Stefan Ratschan:
Combined Global and Local Search for the Falsification of Hybrid Systems. CoRR abs/1406.6332 (2014) - 2013
- [i7]Peter Franek, Stefan Ratschan, Piotr Zgliczynski:
Quasi-decidability of a Fragment of the First-order Theory of Real Numbers. CoRR abs/1309.6280 (2013) - [i6]Milan Hladík, Stefan Ratschan:
Efficient Solution of a Class of Quantified Constraints with Quantifier Prefix Exists-Forall. CoRR abs/1312.6155 (2013) - 2012
- [j14]Lijun Zhang, Zhikun She, Stefan Ratschan, Holger Hermanns, Ernst Moritz Hahn:
Safety Verification for Probabilistic Hybrid Systems. Eur. J. Control 18(6): 572-587 (2012) - [j13]Stefan Ratschan, Thomas Sturm:
Foreword. Math. Comput. Sci. 6(4): 345 (2012) - [i5]Stefan Ratschan:
Applications of Quantified Constraint Solving over the Reals - Bibliography. CoRR abs/1205.5571 (2012) - [i4]Peter Franek, Stefan Ratschan:
Effective Topological Degree Computation Based on Interval Arithmetic. CoRR abs/1207.6331 (2012) - 2011
- [j12]Georgios Fainekos, Eric Goubault, Sylvie Putot, Stefan Ratschan:
Foreword. Math. Comput. Sci. 5(4): 357-358 (2011) - [c17]Tomás Dzetkulic, Stefan Ratschan:
Incremental Computation of Succinct Abstractions for Hybrid Systems. FORMATS 2011: 271-285 - [c16]Peter Franek, Stefan Ratschan, Piotr Zgliczynski:
Satisfiability of Systems of Equations of Real Analytic Functions Is Quasi-decidable. MFCS 2011: 315-326 - 2010
- [j11]Stefan Ratschan, Zhikun She:
Providing a Basin of Attraction to a Target Region of Polynomial Systems by Computation of Lyapunov-Like Functions. SIAM J. Control. Optim. 48(7): 4377-4394 (2010) - [c15]Lijun Zhang, Zhikun She, Stefan Ratschan, Holger Hermanns, Ernst Moritz Hahn:
Safety Verification for Probabilistic Hybrid Systems. CAV 2010: 196-211 - [c14]Stefan Ratschan:
Safety Verification of Non-linear Hybrid Systems Is Quasi-Semidecidable. TAMC 2010: 397-408
2000 – 2009
- 2009
- [c13]Tomás Dzetkulic, Stefan Ratschan:
How to Capture Hybrid Systems Evolution Into Slices of Parallel Hyperplanes. ADHS 2009: 274-279 - [c12]Stefan Ratschan:
Symbolic-numeric problems in the automatic analysis and verification of cyber-physical systems. SNC 2009: 7-8 - [c11]Stefan Ratschan, Jan-Georg Smaus:
Finding Errors of Hybrid Systems by Optimising an Abstraction-Based Quality Estimate. TAP@TOOLS 2009: 153-168 - 2008
- [c10]Stefan Ratschan, Zhikun She:
Recursive and Backward Reasoning in the Verification on Hybrid Systems. ICINCO-SPSMC 2008: 65-71 - 2007
- [j10]Werner Damm, Guilherme Pinto, Stefan Ratschan:
Guaranteed Termination in the Verification of Ltl Properties of Non-linear Robust Discrete Time Hybrid Systems. Int. J. Found. Comput. Sci. 18(1): 63-86 (2007) - [j9]Martin Fränzle, Christian Herde, Tino Teige, Stefan Ratschan, Tobias Schubert:
Efficient Solving of Large Non-linear Arithmetic Constraint Systems with Complex Boolean Structure. J. Satisf. Boolean Model. Comput. 1(3-4): 209-236 (2007) - [j8]Stefan Ratschan, Zhikun She:
Safety verification of hybrid systems by constraint propagation-based abstraction refinement. ACM Trans. Embed. Comput. Syst. 6(1): 8 (2007) - [c9]Felix Klaedtke, Stefan Ratschan, Zhikun She:
Language-Based Abstraction Refinement for Hybrid System Verification. VMCAI 2007: 151-166 - 2006
- [j7]Stefan Ratschan:
Efficient solving of quantified inequality constraints over the real numbers. ACM Trans. Comput. Log. 7(4): 723-748 (2006) - [c8]Stefan Ratschan, Jan-Georg Smaus:
Verification-Integrated Falsification of non-Deterministic Hybrid Systems. ADHS 2006: 371-376 - [c7]Stefan Ratschan, Zhikun She:
Constraints for Continuous Reachability in the Verification of Hybrid Systems. AISC 2006: 196-210 - 2005
- [c6]Werner Damm, Guilherme Pinto, Stefan Ratschan:
Guaranteed Termination in the Verification of LTL Properties of Non-linear Robust Discrete Time Hybrid Systems. ATVA 2005: 99-113 - [c5]Stefan Ratschan:
Solving Undecidable Problems in the Theory of Real Numbers and Hybrid Systems. Algorithmic Algebra and Logic 2005: 213-216 - [c4]Stefan Ratschan, Zhikun She:
Safety Verification of Hybrid Systems by Constraint Propagation Based Abstraction Refinement. HSCC 2005: 573-589 - 2004
- [j6]Luc Jaulin, Stefan Ratschan, Laurent Hardouin:
Set Computation for Nonlinear Control. Reliab. Comput. 10(1): 1-26 (2004) - [j5]Stefan Ratschan:
Convergent approximate solving of first-order constraints by approximate quantifiers. ACM Trans. Comput. Log. 5(2): 264-281 (2004) - 2003
- [c3]Stefan Ratschan:
Solving Existentially Quantified Constraints with One Equality and Arbitrarily Many Inequalities. CP 2003: 615-633 - 2002
- [j4]Stefan Ratschan:
Search Heuristics for Box Decomposition Methods. J. Glob. Optim. 24(1): 35-49 (2002) - [j3]Stefan Ratschan:
Quantified Constraints Under Perturbation. J. Symb. Comput. 33(4): 493-505 (2002) - [j2]Stefan Ratschan:
Approximate Quantified Constraint Solving by Cylindrical Box Decomposition. Reliab. Comput. 8(1): 21-42 (2002) - [c2]Stefan Ratschan:
Continuous First-Order Constraint Satisfaction. AISC 2002: 181-195 - [c1]Stefan Ratschan:
Continuous First-Order Constraint Satisfactionwith Equality and Disequality Constraints. CP 2002: 680-685 - [i3]Stefan Ratschan:
Efficient Solving of Quantified Inequality Constraints over the Real Numbers. CoRR cs.LO/0211016 (2002) - 2001
- [i2]Stefan Ratschan, Luc Jaulin:
Solving Composed First-Order Constraints from Discrete-Time Robust Control. CoRR cs.LO/0105021 (2001) - [i1]Stefan Ratschan:
Convergent Approximate Solving of First-Order Constraints by Approximate Quantifiers. CoRR cs.LO/0108013 (2001) - 2000
- [j1]Stefan Ratschan:
Uncertainty Propagation in Heterogeneous Algebras for Approximate Quantified Constraint Solving. J. Univers. Comput. Sci. 6(9): 861-880 (2000)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-31 21:08 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
