A simpler O (m log n) algorithm for branching bisimilarity on labelled transition systems

Research output: Book/ReportReportProfessional

LanguageEnglish
Place of PublicationEindhoven
PublisherTechnische Universiteit Eindhoven
Number of pages27
StatePublished - 2019

Publication series

NameComputer Science Reports
Volume19-03
ISSN (Print)0926-4515

Cite this

@book{0129948a2d59417eb3239b2e01c25ba2,
title = "A simpler O (m log n) algorithm for branching bisimilarity on labelled transition systems",
author = "Jansen, {David N.} and Groote, {Jan Friso} and Keiren, {Jeroen J.A.} and Anton Wijs",
year = "2019",
language = "English",
series = "Computer Science Reports",
publisher = "Technische Universiteit Eindhoven",

}

Jansen, DN, Groote, JF, Keiren, JJA & Wijs, A 2019, A simpler O (m log n) algorithm for branching bisimilarity on labelled transition systems. Computer Science Reports, vol. 19-03, Technische Universiteit Eindhoven, Eindhoven.

A simpler O (m log n) algorithm for branching bisimilarity on labelled transition systems. / Jansen, David N.; Groote, Jan Friso; Keiren, Jeroen J.A.; Wijs, Anton.

Eindhoven : Technische Universiteit Eindhoven, 2019. 27 p. (Computer Science Reports; Vol. 19-03).

Research output: Book/ReportReportProfessional

TY - BOOK

T1 - A simpler O (m log n) algorithm for branching bisimilarity on labelled transition systems

AU - Jansen,David N.

AU - Groote,Jan Friso

AU - Keiren,Jeroen J.A.

AU - Wijs,Anton

PY - 2019

Y1 - 2019

M3 - Report

T3 - Computer Science Reports

BT - A simpler O (m log n) algorithm for branching bisimilarity on labelled transition systems

PB - Technische Universiteit Eindhoven

CY - Eindhoven

ER -

Jansen DN, Groote JF, Keiren JJA, Wijs A. A simpler O (m log n) algorithm for branching bisimilarity on labelled transition systems. Eindhoven: Technische Universiteit Eindhoven, 2019. 27 p. (Computer Science Reports).