2 citations · 2 across the 1 of their papers we have counts for
1 paper · 1 filter
Toru Takisaka, Yuichiro Oyabu, Natsuki Urabe +1
Computing reachability probabilities is a fundamental problem in the analysis of probabilistic programs. This paper aims at a comprehensive and comparative account on various marti…