• People
• Events
• Research

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

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

Keywords: Design and analysis of algorithms, Theory of concurrent systems, Formal languages, Process algebra.

LFCS report ECS-LFCS-94-288, April 1994.