Ferry Timmers: A complete axiomatisation for probabilistic trace equivalence

Event Details

Probabilistic labelled transition systems combine the expressiveness of Markov chains and processes. We are interested in finding a suitable trace equivalence for such systems, which becomes non-trival once non-determinism is introduced. For this search I have axiomatised one of the equivalences, based on weighed traces, which is a complete axiomatisation, to gain a better understanding of its properties.