Bisimulation equivalence is decidable for basic parallel processes

Søren Christensen, Yoram Hirshfeld, Faron Moller

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

Abstract

In a previous paper the authors proved the decidability of bisimulation equivalence over two subclasses of recursive processes involving a parallel composition operator, namely the so-called normed and live processes. In this paper, we extend this result to the whole class. The decidability proof permits us further to present a complete axiomatisation for this class of basic parallel processes. This result can be viewed as a proper extension of Milner's complete axiomatisation of bisimulation equivalence on regular processes.

Original languageEnglish
Title of host publicationCONCUR 1993 - 4th International Conference on Concurrency Theory, Proceedings
EditorsEike Best
PublisherSpringer Verlag
Pages143-157
Number of pages15
ISBN (Print)9783540572084
DOIs
StatePublished - 1993
Event4th International Conference on Concurrency Theory, CONCUR 1993 - Hildesheim, Germany
Duration: 23 Aug 199326 Aug 1993

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume715 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference4th International Conference on Concurrency Theory, CONCUR 1993
Country/TerritoryGermany
CityHildesheim
Period23/08/9326/08/93

Fingerprint

Dive into the research topics of 'Bisimulation equivalence is decidable for basic parallel processes'. Together they form a unique fingerprint.

Cite this