On the Computational Complexity of Bisimulation, Redux

Faron Moller, Scott Smolka, Jiri Srba

Research output: Contribution to journal › Journal article › Research › peer-review

4 Citations (Scopus)

Abstract

Udgivelsesdato: NOV 1

Original language	English
Journal	Information and Computation
Volume	192
Issue number	2
Pages (from-to)	129-143
Number of pages	14
ISSN	0890-5401
Publication status	Published - 2004

@article{7f7d3320c7d311db86ee000ea68e967b,

title = "On the Computational Complexity of Bisimulation, Redux",

abstract = "Udgivelsesdato: NOV 1",

keywords = "infinite-state processes, verification, survey",

author = "Faron Moller and Scott Smolka and Jiri Srba",

year = "2004",

language = "English",

volume = "192",

pages = "129--143",

journal = "Information and Computation",

issn = "0890-5401",

publisher = "Academic Press",

number = "2",

}

TY - JOUR

T1 - On the Computational Complexity of Bisimulation, Redux

AU - Moller, Faron

AU - Smolka, Scott

AU - Srba, Jiri

PY - 2004

Y1 - 2004

N2 - Udgivelsesdato: NOV 1

AB - Udgivelsesdato: NOV 1

KW - infinite-state processes

KW - verification

KW - survey

M3 - Journal article

SN - 0890-5401

VL - 192

SP - 129

EP - 143

JO - Information and Computation

JF - Information and Computation

IS - 2

ER -