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

DOI10.4230/LIPICS.CONCUR.2021.31MaRDI QIDQ6176115zbMATH OpenOpenAlexFDO

Authors Jan Friso Groote, Jan Martens, Erik de Vink

Publication date 21 August 2023

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

zbMATH Keywords

bisimilaritylabeled transition systemlowerboundpartition refinement

Mathematics Subject Classification ID

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

Cited in

(4)

• From bisimulation to simulation: Coarsest partition problems
• 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).

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6176115)