Maurice Laveaux: Signature-based symbolic bisimulation minimisation

Event Details

Symbolic exploration techniques allow us to construct symbolic state spaces with billions of states. Reducing these state spaces modulo (strong) bisimulation would help in further analysis. In this talk I will present a signature-based partition refinement algorithm from the literature to compute (strong) bisimulation on a symbolic state space. This algorithm requires a transformation of the symbolic state space that we would like to avoid. Therefore, I will also discuss the challenges in adapting this algorithm to our setting.