figshare
Browse

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

Download (1.6 GB)
software
posted on 2020-02-20, 11:48 authored by Anton WijsAnton Wijs, Jeroen KeirenJeroen Keiren, Groote, Jan Friso, David N. JansenDavid N. Jansen
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.

History

Usage metrics

    Licence

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC