Traces via strategies in two-player games
Traces via strategies in two-player games
Traces form a coarse notion of semantic equivalence between states of a process, and have been studied coalgebraically for various types of system. We instantiate the finitary coalgebraic trace semantics framework of Hasuo et al. for controller-versus- environment games, encompassing both nondeterministic and probabilistic environments. Although our choice of monads is guided by the constraints of this abstract framework, they enable us to recover familiar game-theoretic concepts. Concretely, we show that in these games, each element in the trace map corresponds to a collection (a subset or distribution) of plays the controller can force. Furthermore, each element can be seen as the outcome of following a controller strategy. Our results are parametrised by a weak distributive law, which computes what the controller can force in a single step.
Plummer, Benjamin
deeabf9c-07ac-4c16-8d46-f3c469f0f23d
Cirstea, Corina
ce5b1cf1-5329-444f-9a76-0abcc47a54ea
Plummer, Benjamin
deeabf9c-07ac-4c16-8d46-f3c469f0f23d
Cirstea, Corina
ce5b1cf1-5329-444f-9a76-0abcc47a54ea
Plummer, Benjamin and Cirstea, Corina
(2025)
Traces via strategies in two-player games.
41st Conference on Mathematical Foundations of Programming Semantics MFPS XLI (MFPS 2025), , Glasgow, United Kingdom.
18 - 20 Jun 2025.
19 pp
.
(In Press)
Record type:
Conference or Workshop Item
(Paper)
Abstract
Traces form a coarse notion of semantic equivalence between states of a process, and have been studied coalgebraically for various types of system. We instantiate the finitary coalgebraic trace semantics framework of Hasuo et al. for controller-versus- environment games, encompassing both nondeterministic and probabilistic environments. Although our choice of monads is guided by the constraints of this abstract framework, they enable us to recover familiar game-theoretic concepts. Concretely, we show that in these games, each element in the trace map corresponds to a collection (a subset or distribution) of plays the controller can force. Furthermore, each element can be seen as the outcome of following a controller strategy. Our results are parametrised by a weak distributive law, which computes what the controller can force in a single step.
Text
_MFPS25_preproceedings__Traces_via_Strategies_in_Two_Player_Games
- Accepted Manuscript
More information
Accepted/In Press date: June 2025
Venue - Dates:
41st Conference on Mathematical Foundations of Programming Semantics MFPS XLI (MFPS 2025), , Glasgow, United Kingdom, 2025-06-18 - 2025-06-20
Identifiers
Local EPrints ID: 504014
URI: http://eprints.soton.ac.uk/id/eprint/504014
PURE UUID: 33699592-439b-4068-bc30-8ee448c4707f
Catalogue record
Date deposited: 21 Aug 2025 15:22
Last modified: 22 Aug 2025 01:52
Export record
Contributors
Author:
Benjamin Plummer
Author:
Corina Cirstea
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics