A novel algorithm computes minimum reachability probabilities in rectangular automata with random clocks by explicitly separating stochastic and nondeterministic choices along executions.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.FL 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Minimum Reachability Probabilities in Rectangular Automata with Random Clocks
A novel algorithm computes minimum reachability probabilities in rectangular automata with random clocks by explicitly separating stochastic and nondeterministic choices along executions.