On the computational complexity of bisimulation

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback
Take a look at the new version of this page: [ beta version ]. Tell us what you think.

On the computational complexity of bisimulation

Full text

Pdf (284 KB)

Source

ACM Computing Surveys (CSUR) archive
Volume 27 , Issue 2 (June 1995) table of contents

Pages: 287 - 289

Year of Publication: 1995

ISSN:0360-0300

Authors

Faron Moller	SICS, Kista, Sweden
Scott A. Smolka	State Univ. of New York at Stony Brook, Stony Brook

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 32, Citation Count: 2

Additional Information:

cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/210376.210406 What is a DOI?

CITED BY 2

	Faron Moller , Scott A. Smolka, On the computational complexity of bisimulation, redux, Proceedings of the Paris C. Kanellakis memorial workshop on Principles of computing & knowledge: Paris C. Kanellakis memorial workshop on the occasion of his 50th birthday, p.55-59, June 08-08, 2003, San Diego, California, USA
	Marcin Jurdziński , Mogens Nielsen , Jiří Srba, Undecidability of domino games and hhp-bisimilarity, Information and Computation, v.184 n.2, p.343-368, August 01, 2003