An \(O(m\log n)\) algorithm for stuttering equivalence and branching bisimulation

DOI10.1007/978-3-662-49674-9_40zbMath1420.68146arXiv1601.01478OpenAlexW2231202055MaRDI QIDQ2272927

Jan Friso Groote, Anton Wijs

Publication date: 17 September 2019

Full work available at URL: https://arxiv.org/abs/1601.01478

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (6)

A Spatial Logic for Simplicial Models ⋮ Equivalence checking 40 years after: a review of bisimulation tools ⋮ Team equivalences for finite-state machines with silent moves ⋮ A formal verification technique for behavioural model-to-model transformations ⋮ An O(m log n) algorithm for branching bisimilarity on labelled transition systems ⋮ Causal Semantics for BPP Nets with Silent Moves

This page was built for publication: An \(O(m\log n)\) algorithm for stuttering equivalence and branching bisimulation