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

Onderzoeksoutput: Boek/rapport › Rapport › Professioneel

166 Downloads (Pure)

Originele taal-2	Engels
Plaats van productie	Eindhoven
Uitgeverij	Technische Universiteit Eindhoven
Aantal pagina's	27
Status	Gepubliceerd - 2019

Toegang tot document

@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",

}

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 -