The Theory of Traces for Systems with Nondeterminism and Probability

Filippo Bonchi (1) , Ana Sokolova (2) , Valeria Vignudelli (3, 4, 5, 6, 7)

1 University of Pisa - Università di Pisa
2 University of Salzburg
3 Université de Lyon
4 CNRS - Centre National de la Recherche Scientifique
5 ENS de Lyon - École normale supérieure de Lyon
6 LIP - Laboratoire de l'Informatique du Parallélisme
7 UCBL - Université Claude Bernard Lyon 1

This paper studies trace-based equivalences for systems combining nondeterministic and probabilistic choices. We show how trace semantics for such processes can be recovered by instantiating a coalgebraic construction known as the generalised powerset construction. We characterise and compare the resulting semantics to known definitions of trace equivalences appearing in the literature. Most of our results are based on the exciting interplay between monads and their presentations via algebraic theories.

Domaines: Logique en informatique [cs.LO]

Filippo Bonchi, Ana Sokolova, Valeria Vignudelli. The Theory of Traces for Systems with Nondeterminism and Probability. Logic in Computer Science (LICS) 2019, Jun 2019, Vancouver, Canada. ⟨hal-02187093⟩