| Efficient solving of large non-linear arithmetic constraint systems with complex boolean structure M Fränzle, C Herde, T Teige, S Ratschan, T Schubert Journal on Satisfiability, Boolean Modeling and Computation 1 (3-4), 209-236, 2006 | 462 | 2006 |
| Safety verification of hybrid systems by constraint propagation-based abstraction refinement S Ratschan, Z She ACM Transactions on Embedded Computing Systems (TECS) 6 (1), 8-es, 2007 | 213 | 2007 |
| Safety verification of hybrid systems by constraint propagation based abstraction refinement S Ratschan, Z She International workshop on hybrid systems: Computation and control, 573-589, 2005 | 187 | 2005 |
| Efficient solving of quantified inequality constraints over the real numbers S Ratschan ACM Transactions on Computational Logic (TOCL) 7 (4), 723-748, 2006 | 156 | 2006 |
| Providing a basin of attraction to a target region of polynomial systems by computation of Lyapunov-like functions S Ratschan, Z She SIAM Journal on Control and Optimization 48 (7), 4377-4394, 2010 | 139 | 2010 |
| Safety verification for probabilistic hybrid systems L Zhang, Z She, S Ratschan, H Hermanns, EM Hahn European Journal of Control 18 (6), 572-587, 2012 | 117 | 2012 |
| Continuous first-order constraint satisfaction S Ratschan International Conference on Artificial Intelligence and Symbolic Computation …, 2002 | 56 | 2002 |
| Approximate quantified constraint solving by cylindrical box decomposition S Ratschan Reliable Computing 8 (1), 21-42, 2002 | 55 | 2002 |
| Quantified constraints under perturbation S Ratschan Journal of Symbolic Computation 33 (4), 493-505, 2002 | 39 | 2002 |
| RSolver S Ratschan | 37 | 2004 |
| Constraints for continuous reachability in the verification of hybrid systems S Ratschan, Z She International Conference on Artificial Intelligence and Symbolic Computation …, 2006 | 31 | 2006 |
| Applications of quantified constraint solving over the reals-bibliography S Ratschan arXiv preprint arXiv:1205.5571, 2012 | 29 | 2012 |
| Guaranteed termination in the verification of LTL properties of non-linear robust discrete time hybrid systems W Damm, G Pinto, S Ratschan International Journal of Foundations of Computer Science 18 (01), 63-86, 2007 | 29 | 2007 |
| Combined global and local search for the falsification of hybrid systems J Kuřátko, S Ratschan Formal Modeling and Analysis of Timed Systems: 12th International Conference …, 2014 | 28 | 2014 |
| Guaranteed termination in the verification of LTL properties of non-linear robust discrete time hybrid systems W Damm, G Pinto, S Ratschan International Symposium on Automated Technology for Verification and …, 2005 | 28 | 2005 |
| Converse theorems for safety and barrier certificates S Ratschan IEEE Transactions on Automatic Control 63 (8), 2628-2632, 2018 | 26 | 2018 |
| Safety verification of non-linear hybrid systems is quasi-decidable S Ratschan Formal Methods in System Design 44 (1), 71-90, 2014 | 25 | 2014 |
| Safety verification of non-linear hybrid systems is quasi-semidecidable S Ratschan International Conference on Theory and Applications of Models of Computation …, 2010 | 24 | 2010 |
| Applications of quantified constraint solving over the reals–bibliography. arXiv: 1205. 5571v1. Cornell University Library, Ithaca, New York, 2012 S Ratschan | 24 | |
| Effective topological degree computation based on interval arithmetic P Franek, S Ratschan Mathematics of Computation 84 (293), 1265-1290, 2015 | 21 | 2015 |
Zhikun SheSchool of Mathematics and Systems Science, Beihang Universitybuaa.edu.cn üzerinde doğrulanmış e-posta adresine sahip