Search

• < Previous
• 1
• Next >

Lowerbounds for Bisimulation by Partition Refinement

We provide time lower bounds for sequential and parallel algorithms deciding bisimulation on labeled transition systems that use partition refinement. For sequential algorithms this is $\Omega((m \mkern1mu {+} \mkern1mu n ) \mkern-1mu \log \mkern-1mu n)$ and for parallel algorithms this is&nbsp;[&hellip;]