Deciding and axiomatizing weak ST bisimulation for a process algebra with recursion and action refinement

The Digital Librarian's Digital Library

DOCIS Documents in Computing and Information Science

Home >> Journals and Conference Proceedings >> ACM Transactions on Computer Logic

Deciding and axiomatizing weak ST bisimulation for a process algebra with recursion and action refinement

Mario Bravetti, Roberto Gorrieri

Journal Title: ACM Transactions on Computer Logic

Date: 2002

Volume: 3

Issue: 4

p. 465 - 520

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.cs.unibo.it/~bravetti/html/../papers/tocl.ps

For further information about this item go to:

http://doi.acm.org/10.1145/566385.566386

This data comes from DBLP

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