Abstract
We present the first parallel algorithms that decide strong and branching bisimilarity in linear time. More precisely, if a transition system has n states, m transitions and vert Act vert action labels, we introduce an algorithm that decides strong bisimilarity in mathcal {O}(n+vert Act vert ) time on max (n,m) processors and an algorithm that decides branching bisimilarity in mathcal {O}(n+vert Act vert ) time using up to max (n^2,m,vert Act vert n) processors.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
