About Strong and Branching Bisimulation
Jan Friso Groote
Date: Fri, November 25, 2022
Room: Turing 0.E420
Bisimulation, made popular by Robin Milner, is the primary behavioural equivalence for process equivalence. When there are unobservable actions, often denoted by tau’s, are around, branching bisimulation is a natural equivalence. In this talk I will provide an overview about the efficient algorithms for both that actually match natural lowerbounds. I will quickly do the same for parallel algorithms and end with an intriguing, and as it stands difficult, open question.
t.b.a. | Delft-Utrecht Programming Languages Meeting
Next: Anna Lukina | Formal Methods for Learned Systems