A multiset semantics for the pi-calculus with replication

Theoretical Computer Science

Volumn 153, Issue 1-2, 1996, Pages 65-94

  Engelfriet, Joost ^a  

^a LEIDEN UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; AUTOMATA THEORY; COMPUTATIONAL LINGUISTICS; COMPUTATIONAL METHODS; COMPUTER SIMULATION; CONCURRENCY CONTROL; DATA STRUCTURES;

BISIMULATION; CONGRUENT PROCESS; INTERLEAVING TRANSITION SYSTEM; MULTISET SEMANTICS; PI CALCULUS; REPLICATION;

PETRI NETS;

EID: 0030574543     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(95)00118-2     Document Type: Article

References (25)

1. J.C.M. Baeten, J.A. Bergstra and J.W. Klop, An operational semantics for process algebra, in: Mathematical Problems in Computation Theory, Vol. 21 (Banach Center Publications, PWN, Warsaw, 1988) 47-81.
2. J.-P. Bânatre and D. Le Métayer, Programming by multiset transformation, Comm. ACM 36 (1993) 98-111.
3. H.P. Barendregt, The Lambda Calculus (North-Holland, Amsterdam, 1984).
4. G. Berry and G. Boudol, The chemical abstract machine, Theoret. Comput. Sci. 96 (1992) 217-248.
5. G. Boudol, Some chemical abstract machines, in: A Decade of Concurrency, Lecture Notes in Computer Science, Vol. 803, (Springer, Berlin, 1994) 92-123.
6. N.G. De Bruijn, Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, Indag. Math. 34 (1972) 381-392.
7. P. Degano, R. De Nicola and U. Montanari, A distributed operational semantics for CCS based on condition/event systems, Acta Inform. 26 (1988) 59-91.
8. J. Engelfriet, Branching processes of Petri nets, Acta Inform. 28 (1991) 575-591.
9. J. Engelfriet, A multiset semantics of the pi-calculus with replication, in: Proc.CONCUR'93, Lecture Notes in Computer Science, Vol. 715 (Springer, Berlin, 1993) 7-21.
10. J. Engelfriet and T.E. Gelsema, Multisets and structural congruence of the pi-calculus with replication, Tech. Report 95-02, Department of Computer Science, Leiden University, January 1995.
11. U. Goltz, On representing CCS programs by finite Petri nets, in: Proc. MFCS'88, Lecture Notes in Computer Science, Vol. 324 (Springer, Berlin, 1988) 339-350.
12. U. Goltz and W. Reisig, The non-sequential behaviour of Petri nets, Inform. and Control 57 (1983) 125-147.
13. J. Meseguer and U. Montanari, Petri nets are monoids, Inform. and Comput. 88 (1990) 105-155.
14. G. Milne and R. Milner, Concurrent processes and their syntax, J. ACM 26 (1979) 302-321.
15. R. Milner, Flowgraphs and flow algebras, J. ACM 26 (1979) 794-818.
16. R. Milner, Communication and Concurrency (Prentice-Hall, Englewood Cliffs, NJ, 1989).
17. R. Milner, The polyadic π-calculus: a tutorial, Report ECS-LFCS-91-180, University of Edinburgh, 1991.
18. R. Milner, Functions as processes, Math. Struct. in Comput. Sci. 2 (1992) 119-141.
19. R. Milner, J. Parrow and D. Walker, A calculus of mobile processes, Inform. and Comput. 100 (1992) 1-77.
20. R. Milner, Elements of interaction, Comm. ACM 36 (1993) 78-89, Turing Award Lecture.
21. M. Nielsen, CCS and its relationship to net theory, in: Petri Nets: Applications and Relationships to Other Models of Concurrency, Lecture Notes in Computer Science, Vol. 255 (Springer, Berlin, 1987) 393-415.
22. E.-R. Olderog, Nets, Terms and Formulas, (Cambridge Univ. Press, Cambridge, 1991).
23. W. Reisig, Petri Nets, EATCS Monographs in Theoretical Computer Science (Springer, Berlin, 1982).
24. D. Sangiorgi, A theory of bisimulation for the n -calculus, in: Proc.CONCUR'93, Lecture Notes in Computer Science, Vol. 715 (Springer, Berlin, 1993) 127-142. Also, Report ECS-LFCS-93-270, University of Edinburgh.
25. D. Taubner, Finite Representations of CCS and TCSP Programs by Automata and Petri Nets, Lecture Notes in Computer Science, Vol. 369 (Springer, Berlin, 1989).