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 …

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 …

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

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

Game comonads represent a rare application of category theoretic methods to the fields of
finite model theory and descriptive complexity. First introduced by Abramsky, Dawar and …

Open parity games are proposed as a compositional extension of parity games with
algebraic operations, forming string diagrams of parity games. A potential application of …

We define a bidirectional compositional framework for Petri nets based on a line of work
about compositionally defining games and computation models. This relies on defining …

I would like to contribute a talk outlining our recent published works [21–23]. Systems with
uncertainties, including Markov decision processes (MDPs)[17], are a main subject in …

Category Theory Page 1 Category Theory for Compositional Verification Kazuki Watanabe
Clovis Eberhart] - Kazuyuki Asada" Ichiro Hasro2 Page 2 Category Theory for Compositional …