A pervasive question about stochastic systems is: when are two systems equivalent? More generally, when are two systems close? In this talk I will look at Markov Processes, and notions of bisimulations for them. This excursion will involve finding logical properties for bisimulation, à la Hennessey and Milner, and then constructing efficient algorithms.
Bio: Nathanaël Fijalkow received his PhD in Computer Science in 2015, entitled "Counting and Randomising in Automata Theory", supervised by Thomas Colcombet and Mikołaj Bojańczyk. He was a Research Assistant in Oxford with James Worrell and Joël Ouaknine, and then a Research Fellow at the Simons Institute in Berkeley for the semester Logical Structures in Computation. Since January 2017, he is a Research Fellow at the Alan Turing Institute of Data Science, in London.