Strong bisimilarity of simple process algebras: complexity lower bounds

The Digital Librarian's Digital Library

DOCIS Documents in Computing and Information Science

Home >> Journals and Conference Proceedings >> Acta Informatica

Strong bisimilarity of simple process algebras: complexity lower bounds

Jirí Srba

Journal Title: Acta Informatica

Date: 2003

Volume: 39

Issue: 6-7

p. 469 - 499

We have been looking for this document on the Web. We think we have found the following, freely available version(s) of it:

http://www.brics.dk/RS/02/16/BRICS-RS-02-16.pdf

http://www.brics.dk/RS/02/16/BRICS-RS-02-16.ps.gz

http://www.brics.dk/~srba/files/S:ACTA:03.pdf

http://www.brics.dk/~srba/files/S:ACTA:03.ps

For further information about this item go to:

http://www.springerlink.com/openurl.asp?genre=article&issn=0001-5903&volume=39&issue=6&spage=469

This data comes from DBLP

This page is maintained by Angela Cornwell and Thomas Krichel.
It was last updated on 2006-04-12