research
∙
07/11/2023
Computing minimal distinguishing Hennessy-Milner formulas is NP-hard, but variants are tractable
We study the problem of computing minimal distinguishing formulas for no...
share
research
∙
03/14/2022
Lowerbounds for Bisimulation by Partition Refinement
We provide time lower bounds for sequential and parallel algorithms deci...
research
∙
05/25/2021
A linear parallel algorithm to compute bisimulation and relational coarsest partitions
The most efficient way to calculate strong bisimilarity is by calculatio...
research
∙
09/15/2020