Decomposability, decidability and axiomatisability for bisimulation equivalence on basic parallel processes

Soren Christensen, Yoram Hirshfeld, Faron Moller

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We prove the decidability of two subclasses of recursive processes involving a parallel composition operator with respect to bisimulation equivalence, namely the so-called normed and live processes. To accomplish this, we first prove a unique decomposition result for (a generalization of) normed processes, in order to deduce a necessary cancellation law. The decidability proof permits us further to present a complete axiomatization for these process classes.

Original languageEnglish
Title of host publicationLogic in Computer Science
PublisherPubl by IEEE
Pages386-396
Number of pages11
ISBN (Print)0818631422
StatePublished - 1993
Externally publishedYes
EventProceedings of the Eighth Annual IEEE Symposium on Logic in Computer Science - Montreal, Quebec, Can
Duration: 19 Jun 199323 Jun 1993

Publication series

NameProceedings - Symposium on Logic in Computer Science

Conference

ConferenceProceedings of the Eighth Annual IEEE Symposium on Logic in Computer Science
CityMontreal, Quebec, Can
Period19/06/9323/06/93

Fingerprint

Dive into the research topics of 'Decomposability, decidability and axiomatisability for bisimulation equivalence on basic parallel processes'. Together they form a unique fingerprint.

Cite this