A π-calculus with explicit substitutions

Theoretical Computer Science

Volumn 168, Issue 1, 1996, Pages 53-103

  Ferrari, Gian Luigi ^a   Montanari, Ugo ^a   Quaglia, Paola ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTER SIMULATION; EQUIVALENCE CLASSES;

BISIMULATION SEMANTICS; EXPLICIT SUBSTITUTIONS; TRANSITIONAL SEMANTICS;

COMPUTATIONAL LINGUISTICS;

EID: 0030289746     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(96)00063-1     Document Type: Article

References (22)

1. L. Aceto, B. Bloom and F. Vaandrager, Turning SOS Rules into Equations, Inform. Comput. 111 (1994) 1-52.
2. J.A. Bergstra and J.W. Klop, Process algebra for synchronous communication, Inform. and Control 60 (1984) 109-137.
3. B. Bloom, S. Istrail and A.R. Meyer, Bisimulation can't be traced, J. ACM 42 (1995) 232-268.
4. R. Cleaveland, J. Parrow and B. Steffen, The concurrency workbench: a semantics-based tool for the verification of concurrent systems, ACM Trans. Programming Languages Systems 15 (1993) 36-72.
5. R. De Simone, Higher level synchronizing devices in MEIJE-SCCS, Theoret. Comput. Sci. 37 (1985) 245-267.
6. G.-L. Ferrari, R. Gorrieri and U. Montanari, An extended expansion theorem, in: Proc. TAPSOFT '91, Lecture Notes in Computer Science, Vol. 494 (Springer, Berlin, 1991).
7. G.-L. Ferrari, G. Modoni and P. Quaglia, Towards a semantic-based verification environment for the π-calculus, Proc. 5th Italian Conf. on Theoret. Comput. Sci., 1995, to appear.
8. G.-L. Ferrari, U. Montanari and P. Quaglia, A π-calculus with explicit substitutions: the late semantics, in: Proc. MFCS '94, Lecture Notes in Computer Science, Vol. 841 (Springer, Berlin, 1994).
9. G.-L. Ferrari, U. Montanari and P. Quaglia, The weak late π-calculus semantics as observation equivalence, in: Proc. CONCUR '95, Lecture Notes in Computer Science (Springer, Berlin, 1995), to appear.
10. J.F. Groote and F. Vaandrager, Structured operational semantics and bisimulation as a congruence, Inform. Comput. 100 (1992) 202-260.
11. M. Hennessy and H. Lin, Symbolic bisimulations, Tech. Report 1/92, Computer Science, University of Sussex, 1992.
12. M. Hennessy and R. Milner, Algebraic laws for nondeterminism and concurrency, J. ACM 32 (1985) 137-161.
13. J. McCarthy, Recursive functions of symbolic expressions and their computation by machine, Part 1, Comm. ACM 3 (1960).
14. R. Milner, A calculus of communicating systems, Lecture Notes in Computer Science, Vol. 92 (Springer, Berlin, 1980).
15. R. Milner, Calculi for synchrony and asynchrony, Theoret. Comput. Sci. 25 (1983) 267-310.
16. R. Milner, Weak bisimilarity: congruences and equivalences, unpublished notes, 1990.
17. R. Milner, J. Parrow and D. Walker, A Calculus of Mobile Processes, Parts I and II, Inform. Comput. 100 (1992) 1-77.
18. R. Milner, J. Parrow and D. Walker, Modal logics for mobile processes, Theoret. Comput. Sci. 114 (1993) 149-171.
19. D. Park, Concurrency and automata on infinite sequences, in: Proc. 5th GI-Conf., Lecture Notes in Computer Science, Vol. 104 (Springer, Berlin, 1981).
20. G.D. Plotkin, A structural approach to operational semantics, Tech. Report DAIMI-FN-19, Computer Science Department, Aarhus University, 1981.
21. P. Quaglia, Ph.D. Thesis, Università degli Studi di Pisa, 1995, in preparation.
22. D. Sangiorgi, A theory of bisimulation for the π-calculus, in: Proc. CONCUR '93, Lecture Notes in Computer Science, Vol. 715 (Springer, Berlin, 1993).