Multisets and structural congruence of the pi-calculus with replication. (English) Zbl 0912.68125

Summary: In the \(\pi\)-calculus with replication, two processes are multiset congruent if they have the same semantics in the multiset transition system \(M\pi\). It is proved that (extended) structural congruence is the same as multiset congruence, and that it is decidable.


68Q55 Semantics in the theory of computing
Full Text: DOI


[1] Berry, G.; Boudol, G., The chemical abstract machine, Theoret. Comput. Sci., 96, 217-248 (1992) · Zbl 0747.68013
[2] Engelfriet, J., A multiset semantics for the pi-calculus with replication, Theoret. Comput. Sci., 153, 65-94 (1996) · Zbl 0872.68125
[3] Milne, G.; Milner, R., Concurrent processes and their syntax, J. ACM, 26, 302-321 (1979) · Zbl 0395.68030
[4] Milner, R., Flowgraphs and flow algebras, J. ACM, 26, 794-818 (1979) · Zbl 0421.68025
[5] Milner, R., Communication and Concurrency (1989), Prentice-Hall: Prentice-Hall Englewood Cliffs, NJ · Zbl 0683.68008
[6] Milner, R., Functions as processes, Math. Struct. Comput. Sci., 2, 119-141 (1992) · Zbl 0773.03012
[7] Milner, R., Turing Award Lecture: Elements of interaction, Comm. ACM, 36, 78-89 (1993)
[8] Milner, R.; Parrow, J.; Walker, D., A calculus of mobile processes, Inform. Comput., 100, 1-77 (1992) · Zbl 0752.68037
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.