Speaker: Nikola Trcka (TU/e, FM)
Title: Transition Systems in Matrix Theory - Connection with
       Markov Chain Theory

Abstract:
The theory of Markov chains (MCs) is usually presented in terms of
matrices. In this talk I will follow that approach but for labeled
transition systems (LTSs) and bisimulations. The advantage of the
new setting (notation) is not only that it increases compactness
and comes with a well-developed algebraic apparatus, but more that
it almost directly leads to several new and useful notions in both
the MC and the LTS world. For example, I will show that rewards in
MCs behave as terminating states in LTSs, that strong lumping for
MCs is the same as strong bisimulation, and that the notion of
tau-lumping that we have recently developed is just weak
bisimulation. I will also try to interpret branching bisimulation
in the MC setting, and the tau-reduction method in the LTS setting.