On the Computational Complexity of Bisimulation, Redux

Faron Moller; Scott A. Smolka

doi:10.1145/778348.778357

On the Computational Complexity of Bisimulation, Redux

Faron Moller
, Scott A. Smolka

Computer Science

Swansea University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Scopus citations

Original language	English
Title of host publication	Principles of Computing and Knowledge
Subtitle of host publication	Paris C. Kanellakis Memorial Workshop
Publisher	Association for Computing Machinery (ACM)
Pages	55-59
Number of pages	5
ISBN (Print)	1581136048, 9781581136043
DOIs	https://doi.org/10.1145/778348.778357
State	Published - 2003
Event	PCK50: Principles of Computing and Knowledge: Paris C. Kanellakis Memorial Workshop - San Diego, CA, United States Duration: Jun 8 2003 → Jun 8 2003

Publication series

Name	Principles of Computing and Knowledge: Paris C. Kanellakis Memorial Workshop

Conference

Conference	PCK50: Principles of Computing and Knowledge: Paris C. Kanellakis Memorial Workshop
Country/Territory	United States
City	San Diego, CA
Period	06/8/03 → 06/8/03

Keywords

Theory
Verification

Access to Document

10.1145/778348.778357

Cite this

@inproceedings{672ffc0fc37241c8ac00291c95081d7e,

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

keywords = "Theory, Verification",

author = "Faron Moller and Smolka, \{Scott A.\}",

year = "2003",

doi = "10.1145/778348.778357",

language = "English",

isbn = "1581136048",

series = "Principles of Computing and Knowledge: Paris C. Kanellakis Memorial Workshop",

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

pages = "55--59",

booktitle = "Principles of Computing and Knowledge",

note = "PCK50: Principles of Computing and Knowledge: Paris C. Kanellakis Memorial Workshop ; Conference date: 08-06-2003 Through 08-06-2003",

}

Moller, F & Smolka, SA 2003, On the Computational Complexity of Bisimulation, Redux. in Principles of Computing and Knowledge: Paris C. Kanellakis Memorial Workshop. Principles of Computing and Knowledge: Paris C. Kanellakis Memorial Workshop, Association for Computing Machinery (ACM), pp. 55-59, PCK50: Principles of Computing and Knowledge: Paris C. Kanellakis Memorial Workshop, San Diego, CA, United States, 06/8/03. https://doi.org/10.1145/778348.778357

On the Computational Complexity of Bisimulation, Redux. / Moller, Faron; Smolka, Scott A.
Principles of Computing and Knowledge: Paris C. Kanellakis Memorial Workshop. Association for Computing Machinery (ACM), 2003. p. 55-59 (Principles of Computing and Knowledge: Paris C. Kanellakis Memorial Workshop).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - On the Computational Complexity of Bisimulation, Redux

AU - Moller, Faron

AU - Smolka, Scott A.

PY - 2003

Y1 - 2003

KW - Theory

KW - Verification

UR - https://www.scopus.com/pages/publications/0141929292

U2 - 10.1145/778348.778357

DO - 10.1145/778348.778357

M3 - Conference contribution

AN - SCOPUS:0141929292

SN - 1581136048

SN - 9781581136043

T3 - Principles of Computing and Knowledge: Paris C. Kanellakis Memorial Workshop

SP - 55

EP - 59

BT - Principles of Computing and Knowledge

PB - Association for Computing Machinery (ACM)

T2 - PCK50: Principles of Computing and Knowledge: Paris C. Kanellakis Memorial Workshop

Y2 - 8 June 2003 through 8 June 2003

ER -

On the Computational Complexity of Bisimulation, Redux

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this