In: Theoretical Computer Science, Vol. 211, No. 1-2, pages 311-337. 1999.
Abstract: In the pi-calculus with replication, two processes are multiset congruent if they have the same semantics in the associated multiset transition system. It is proved that (extended) structural congruence is the same as multiset congruence, and that it is decidable.
Keywords: Petri nets, multiset transition systems, pi-calculus.
Back to the Petri Nets Bibliography