University of Birmingham > Talks@bham > Theoretical computer science seminar > Trace Theory for Probability and Nondeterminism

Trace Theory for Probability and Nondeterminism

Add to your list(s) Download to your calendar using vCal

  • UserAna Sokolova, University of Salzburg
  • ClockFriday 24 April 2020, 11:00-12:00
  • HouseZoom.

If you have a question about this talk, please contact Paul Levy.

In this talk I will show how trace semantics for systems with probability and nondeterminism can be recovered by instantiating a coalgebraic construction known as generalised determinisation. 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. The talk is based on joint work with Filippo Bonchi and Valeria Vignudelli (presented at LICS 2019 ).

This talk is part of the Theoretical computer science seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


Talks@bham, University of Birmingham. Contact Us | Help and Documentation | Privacy and Publicity.
talks@bham is based on from the University of Cambridge.