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

Yoram Hirshfeld, Mark Jerrum, Faron Moller · Mathematical Structures in Computer Science · 1996

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.

Read the paper · More papers on PaperTik