An O(m log n) Algorithm for Computing Stuttering Equivalence and Branching Bisimulation

J.F. Groote; D.N. Jansen; J.J.A. Keiren; A.J. Wijs

doi:10.1145/3060140

An O(m log n) Algorithm for Computing Stuttering Equivalence and Branching Bisimulation

J.F. Groote, D.N. Jansen, J.J.A. Keiren, A.J. Wijs

Research Line Resilience (part of LIRS program)

Research output: Contribution to journal › Article › Academic › peer-review

10 Citations (Web of Science)

Original language	English
Article number	13
Journal	Acm Transactions on Computational Logic
Volume	18
Issue number	2
DOIs	https://doi.org/10.1145/3060140
Publication status	Published - 23 Jun 2017

Keywords

branching bisimulation
algorithm

Access to Document

10.1145/3060140

Cite this

@article{2834e58fc12e463498033c6d920be70c,

title = "An O(m log n) Algorithm for Computing Stuttering Equivalence and Branching Bisimulation",

keywords = "branching bisimulation, algorithm",

author = "J.F. Groote and D.N. Jansen and J.J.A. Keiren and A.J. Wijs",

year = "2017",

month = jun,

day = "23",

doi = "10.1145/3060140",

language = "English",

volume = "18",

journal = "Acm Transactions on Computational Logic",

issn = "1529-3785",

publisher = "Association for Computing Machinery (ACM)",

number = "2",

}

TY - JOUR

T1 - An O(m log n) Algorithm for Computing Stuttering Equivalence and Branching Bisimulation

AU - Groote, J.F.

AU - Jansen, D.N.

AU - Keiren, J.J.A.

AU - Wijs, A.J.

PY - 2017/6/23

Y1 - 2017/6/23

KW - branching bisimulation

KW - algorithm

U2 - 10.1145/3060140

DO - 10.1145/3060140

M3 - Article

SN - 1529-3785

VL - 18

JO - Acm Transactions on Computational Logic

JF - Acm Transactions on Computational Logic

IS - 2

M1 - 13

ER -

An O(m log n) Algorithm for Computing Stuttering Equivalence and Branching Bisimulation

Keywords

Access to Document

Fingerprint

Cite this