6 citations · 14 across the 7 of their papers we have counts for
7 papers · 1 filter
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…
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…
Codensity Games for Bisimilarity
Yuichi Komorida, Shin-ya Katsumata, Nick Hu +2
Bisimilarity as an equivalence notion of systems has been central to process theory. Due to the recent rise of interest in quantitative systems (probabilistic, weighted, hybrid, et…
Simple game semantics and Day convolution
Clovis Eberhart, Tom Hirschowitz, Alexis Laouar
Game semantics has provided adequate models for a variety of programming languages, in which types are interpreted as two-player games and programs as strategies. Melliès (2018) su…
What's in a game? A theory of game models
Clovis Eberhart, Tom Hirschowitz
Game semantics is a rich and successful class of denotational models for programming languages. Most game models feature a rather intuitive setup, yet surprisingly difficult proofs…
An intensionally fully-abstract sheaf model for (expanded version)
Clovis Eberhart, Tom Hirschowitz, Thomas Seiller
Following previous work on CCS, we propose a compositional model for the -calculus in which processes are interpreted as sheaves on certain simple sites. Such sheaves are a conc…
Fully-abstract concurrent games for pi
Clovis Eberhart, Tom Hirschowitz, Thomas Seiller
We define a semantics for Milner's pi-calculus, with three main novelties. First, it provides a fully-abstract model for fair testing equivalence, whereas previous semantics covere…