6 papers
Value Iteration for Stochastic Parity Games
Kittiphon Phalakarn, Ichiro Hasuo
We present the first (bounded) value iteration algorithm for the quantitative analysis of stochastic parity games, a fundamental model for probabilistic verification with -regu…
A Coalgebraic Dijkstra Algorithm
Takahiro Sanada, Yoà v Montacute, Kittiphon Phalakarn +1
The Dijkstra algorithm is a classical method for solving the shortest path problem on weighted graphs. There are several variations of the Dijkstra algorithm, including algorithms…
Monads and Distributive Laws in Substructural Contexts (Extended Version)
Soichiro Fujii, Yun Chen Tsai, Yoà v Montacute +1
We present a categorical theory of monads and distributive laws in substructural contexts. In the study of distributive laws, the roles of (the absence of) structural rules for var…
Strategy Templates for Almost-Sure and Positive Winning of Stochastic Parity Games towards Permissive and Resilient Control
Kittiphon Phalakarn, Sasinee Pruekprasert, Ichiro Hasuo
Stochastic games are fundamental in various applications, including the control of cyber-physical systems (CPS), where both controller and environment are modeled as players. Tradi…
Widest Path Games and Maximality Inheritance in Bounded Value Iteration for Stochastic Games
Kittiphon Phalakarn, Yun Chen Tsai, Ichiro Hasuo
For model checking stochastic games (SGs), bounded value iteration (BVI) algorithms have gained attention as efficient approximate methods with rigorous precision guarantees. Howev…
Chance and Mass Interpretations of Probabilities in Markov Decision Processes (Extended Version)
Yun Chen Tsai, Kittiphon Phalakarn, S. Akshay +1
Markov decision processes (MDPs) are a popular model for decision-making in the presence of uncertainty. The conventional view of MDPs in verification treats them as state transfor…