An \(O(m \log n)\) algorithm for branching bisimilarity on labelled transition systems (Q5164166)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7423365
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An \(O(m \log n)\) algorithm for branching bisimilarity on labelled transition systems |
scientific article; zbMATH DE number 7423365 |
Statements
An O(m log n) algorithm for branching bisimilarity on labelled transition systems (English)
0 references
10 November 2021
0 references
branching bisimilarity
0 references
algorithm
0 references
labelled transition systems
0 references
0 references
0.8465879559516907
0 references
0.8395662307739258
0 references
0.8377560377120972
0 references
0.8364553451538086
0 references
0.8362911939620972
0 references
