activity
20202025
most citedA Compositional Approach to Parity Games

6 citations · 6 across the 7 of their papers we have counts for

collaborators

7 papers

cs.LO2025

Compositional Verification of Almost-Sure Büchi Objectives in MDPs

Marck van der Vegt, Kazuki Watanabe, Ichiro Hasuo +1

This paper studies the verification of almost-sure Büchi objectives in MDPs with a known, compositional structure based on string diagrams. In particular, we ask whether there is a…

cs.LO2024

Compositional Value Iteration with Pareto Caching

Kazuki Watanabe, Marck van der Vegt, Sebastian Junges +1

The de-facto standard approach in MDP verification is based on value iteration (VI). We propose compositional VI, a framework for model checking compositional MDPs, that addresses…

cs.LO2024

Pareto Curves for Compositionally Model Checking String Diagrams of MDPs

Kazuki Watanabe, Marck van der Vegt, Ichiro Hasuo +2

Computing schedulers that optimize reachability probabilities in MDPs is a standard verification task. To address scalability concerns, we focus on MDPs that are compositionally de…

cs.LO2023

Compositional Probabilistic Model Checking with String Diagrams of MDPs

Kazuki Watanabe, Clovis Eberhart, Kazuyuki Asada +1

We present a compositional model checking algorithm for Markov decision processes, in which they are composed in the categorical graphical language of string diagrams. The algorith…

cs.LO2023

Compositional Solution of Mean Payoff Games by String Diagrams

Kazuki Watanabe, Clovis Eberhart, Kazuyuki Asada +1

Following our recent development of a compositional model checking algorithm for Markov decision processes, we present a compositional framework for solving mean payoff games (MPGs…

cs.GT2021★ 6 cited

A Compositional Approach to Parity Games

Kazuki Watanabe, Clovis Eberhart, Kazuyuki Asada +1

In this paper, we introduce open parity games, which is a compositional approach to parity games. This is achieved by adding open ends to the usual notion of parity games. We intro…

cs.LO2020

On principal types and well-foundedness of the cummulativity relation in ECC

Eitetsu Ken, Masaki Natori, Kenji Tojo +1

When we investigate a type system, it is helpful if we can establish the well-foundedness of types or terms with respect to a certain hierarchy, and the Extended Calculus of Constr…