An O(m log n) Algorithm for Branching Bisimilarity on Labelled Transition Systems

Dataset

Description

This software provides implementations of various branching bisimilarity algorithms, as present in the mCRL2 toolset, as well as a benchmark set and scripts to experimentally compare the implementations. The purpose of this artifact is to provide all resources necessary to validate the results reported in the TACAS 2020 paper "An O(m log n) Algorithm for Branching Bisimilarity on Labelled Transition Systems", by D.N. Jansen, J.-F. Groote, J.J.A. Keiren and A.J. Wijs.
Date made available20 Feb 2020
PublisherFigshare

Cite this