Bisimulation by Partitioning Is Ω((m+n)log n).

DOI10.4230/lipics.concur.2021.31OpenAlexW3197687118MaRDI QIDQ6176115

Jan Friso Groote, E. P. de Vink, Jan Martens

Publication date: 21 August 2023

Full work available at URL: https://doi.org/10.4230/lipics.concur.2021.31

zbMATH Keywords

partition refinementbisimilaritylabeled transition systemlowerbound

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (3)

Minimality Notions via Factorization Systems and Examples ⋮ Lowerbounds for Bisimulation by Partition Refinement ⋮ Equivalence checking 40 years after: a review of bisimulation tools

This page was built for publication: Bisimulation by Partitioning Is Ω((m+n)log n).