Erik de Vink: In search of for stability: cancelativity for probabilistic bisimulation

Event Details

In an ongoing project on the complete axiomatization of branching probabilistic bisimulation, we are currently focusing on a cancellation property. We see a route of proving the property by means of topological arguments which seems a bit far-fetched. As a possible alternative approach we propose the notion of a stable process. A process is stable if it doesn’t allow (partial) inert transitions. In the talk, we discuss the setting, the cancelativity, property and whether each process will evolve into a stable processes eventually.