SODA

A polynomial-time algorithm for deciding bisimilation equivalence of normed Basic Parallel Processes

Hirshfeld, Yoram and Jerrum, Mark and Moller, Faron (1994) A polynomial-time algorithm for deciding bisimilation equivalence of normed Basic Parallel Processes. [SICS Report]

[img]Postscript
61Kb

Abstract

A polynomial-time algorithm is presented for deciding bisimulation equivalence of so-called Basic Parallel Processes: multisets of elementary processes combined by a commitative parallel-composition operator.

Item Type:SICS Report
Uncontrolled Keywords:Process algebra, Formal languages, Analysis of algorithms
ID Code:2130
Deposited By:Vicki Carleson
Deposited On:22 Oct 2007
Last Modified:18 Nov 2009 16:00

Repository Staff Only: item control page