Showing cs.SCShow all
3 papers · 1 filter
cs.SC2025
Scaling Up Reachability Analysis for Rectangular Automata with Random Clocks
Jonas Stübbe, Anne Remke, Erika Ábrahám
This paper presents optimizations to improve the scalability of reachability analysis on a subclass of hybrid automata extended with stochasticity. The optimizations target differe…
cs.SC2025
Projective Delineability for Single Cell Construction
Jasper Nalbach, Lucas Michel, Erika Ábrahám +5
The cylindrical algebraic decomposition (CAD) is the only complete method used in practice for solving problems like quantifier elimination or SMT solving related to real algebra,…
cs.SC2025
A Variant of Non-uniform Cylindrical Algebraic Decomposition for Real Quantifier Elimination
Jasper Nalbach, Erika Ábrahám
The Cylindrical Algebraic Decomposition (CAD) method is currently the only complete algorithm used in practice for solving real-algebraic problems. To ameliorate its doubly-exponen…