9 citations · 9 across the 1 of their papers we have counts for
3 papers
Widest Paths and Global Propagation in Bounded Value Iteration for Stochastic Games
Kittiphon Phalakarn, Toru Takisaka, Thomas Haas +1
Solving stochastic games with the reachability objective is a fundamental problem, especially in quantitative verification and synthesis. For this purpose, bounded value iteration…
Moment Propagation of Discrete-Time Stochastic Polynomial Systems using Truncated Carleman Linearization
Sasinee Pruekprasert, Toru Takisaka, Clovis Eberhart +2
We propose a method to compute an approximation of the moments of a discrete-time stochastic polynomial system. We use the Carleman linearization technique to transform this finite…
Ranking and Repulsing Supermartingales for Reachability in Probabilistic Programs
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…