2 papers
cs.SC2023
Exploiting Strict Constraints in the Cylindrical Algebraic Covering
Philipp Bär, Jasper Nalbach, Erika Ábrahám +1
One of the few available complete methods for checking the satisfiability of sets of polynomial constraints over the reals is the cylindrical algebraic covering (CAlC) method. In t…
cs.FL2023
Maximizing Reachability Probabilities in Rectangular Automata with Random Clocks
Joanna Delicaris, Stefan Schupp, Erika Ábrahám +1
This paper proposes an algorithm to maximize reachability probabilities for rectangular automata with random clocks via a history-dependent prophetic scheduler. This model class in…