The D-CON is drawing closer. It is a conference about distributed computing organized by the chair i7 (essentially, us; specifically, Stefan Jaax and Philipp Meyer) from the 14th to the 15th of March. The two invited talks are by Filip Mazowiecki about the reachability problem for Petri nets being not elementary and by Karoliina Lehtinen about quasi-polynomial automata for playing with parity games. Other speakers are Christoph Matheja, Sebastian Kenter, Jens Gutsfeld, Lars Luthmann, Hendrik Göttmann, Sebastian Wolff, Dennis Nolte, Christina Mika-Michalski, Harsh Beohar, Johannes Gareis, Ronja Enseleit, Gereon Fox and Uwe Nestmann. We are looking forward to welcoming all speakers and attendees at the TUM!
Philipp Meyer held his talk at TACAS’19 about “Computing the expected execution time of probabilistic Workflow-Nets”. The slides can be found here.