7 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…
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…
A Matrix Decomposition Method for Odd-Type Gaussian Normal Basis Multiplication
Kittiphon Phalakarn, Athasit Surarerks
Normal basis is used in many applications because of the efficiency of the implementation. However, most space complexity reduction techniques for binary field multiplier are appli…
Optimal Representation for Right-to-Left Parallel Scalar Point Multiplication
Kittiphon Phalakarn, Kittiphop Phalakarn, Vorapong Suppakitpaisarn
This paper introduces an optimal representation for a right-to-left parallel elliptic curve scalar point multiplication. The right-to-left approach is easier to parallelize than th…
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…