15 citations · 32 across the 13 of their papers we have counts for
13 papers
Weakly Non-Negative Supermartingales for Omega-Regular Verification
Toru Takisaka, Hongjie Qing, Libo Zhang
Martingale-based methods are central to probabilistic program verification, but strong global non-negativity requirements can exclude simple certificates from tractable template cl…
Situational-Constrained Sequential Resources Allocation via Reinforcement Learning
Libo Zhang, Yang Chen, Toru Takisaka +3
Sequential Resource Allocation with situational constraints presents a significant challenge in real-world applications, where resource demands and priorities are context-dependent…
Systematic Parameter Decision in Approximate Model Counting
Jinping Lei, Toru Takisaka, Junqiang Peng +1
This paper proposes a novel approach to determining the internal parameters of the hashing-based approximate model counting algorithm . In this problem, the chos…
Connectivity in the presence of an opponent
Zihui Liang, Bakh Khoussainov, Toru Takisaka +1
The paper introduces two player connectivity games played on finite bipartite graphs. Algorithms that solve these connectivity games can be used as subroutines for solving Müller g…
Lexicographic Ranking Supermartingales with Lazy Lower Bounds
Toru Takisaka, Libo Zhang, Changjiang Wang +1
Lexicographic Ranking SuperMartingale (LexRSM) is a probabilistic extension of Lexicographic Ranking Function (LexRF), which is a widely accepted technique for verifying program te…
Learning Density-Based Correlated Equilibria for Markov Games
Libo Zhang, Yang Chen, Toru Takisaka +3
Correlated Equilibrium (CE) is a well-established solution concept that captures coordination among agents and enjoys good algorithmic properties. In real-world multi-agent systems…
Dynamic Shielding for Reinforcement Learning in Black-Box Environments
Masaki Waga, Ezequiel Castellano, Sasinee Pruekprasert +3
It is challenging to use reinforcement learning (RL) in cyber-physical systems due to the lack of safety guarantees during learning. Although there have been various proposals to r…
Moment Propagation of Polynomial Systems Through Carleman Linearization for Probabilistic Safety Analysis
Sasinee Pruekprasert, Jérémy Dubut, Toru Takisaka +2
We develop a method to approximate the moments of a discrete-time stochastic polynomial system. Our method is built upon Carleman linearization with truncation. Specifically, we ta…
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…
Large Scale Geometries of Infinite Strings
Bakhadyr Khoussainov, Toru Takisaka
We introduce geometric consideration into the theory of formal languages. We aim to shed light on our understanding of global patterns that occur on infinite strings. We utilise me…
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…
On Gács' quantum algorithmic entropy
Toru Takisaka
We define an infinite dimensional modification of lower-semicomputability of density operators by Gács with an attempt to fix some problem in the paper. Our attempt is partly achie…