On barbed equivalences in π-calculus

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2154, Issue , 2001, Pages 292-304

  Sangiorgi, Davide ^a   Walker, David ^b  

^a INRIA   (France)

^b UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

BISIMILARITY; BISIMULATIONS; INFINITE SUMS; NEW RESULTS; PI CALCULUS;

CALCULATIONS;

EID: 84944044068     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44685-0_20     Document Type: Conference Paper

References (13)

1. M. Abadi and C. Fournet. Mobile Values, New Names, and Secure Communication. In 28th Annual Symposium on Principles of Programming Languages. ACM, 2001.
2. P. Aczel. An introduction to inductive definitions. In Handbook of Mathematical Logic. North Holland, 1977.
3. R. Amadio, I. Castellani, and D. Sangiorgi. On bisimulations for the asynchronous π-calculus. Theoretical Computer Science, 195(2):291–324, 1998.
4. C. Fournet and G. Gonthier. A hierarchy of equivalences for asynchronous calculi. In ICALP’98: Automata, Languages and Programming, volume 1443 of Lecture Notes in Computer Science. Springer-Verlag, 1998.
5. K. Honda and N. Yoshida. On reduction-based process semantics. Theoretical Computer Science, 152(2):437–486, 1995.
6. A. Jeffrey and J. Rathke. A theory of bisimulation for a fragment of Concurrent MLwith local names. In 15th Annual IEEE Symposium on Logic in Computer Science. IEEE Computer Society Press, 2000.
7. M. Merro. Locality in the π-calculus and Applications to Object-Oriented Languages. PhD thesis, Ecole des Mines de Paris, 2000.
8. R. Milner. The polyadic π-calculus: a tutorial. In Logic and Algebra of Specification. Springer-Verlag, 1993.
9. R. Milner and D. Sangiorgi. Barbed bisimulation. In ICALP’92: Automata, Languages and Programming, volume 623 of Lecture Notes in Computer Science. Springer-Verlag, 1992.
10. U. Montanari and V. Sassone. Dynamic congruence vs. progressing bisimulation for CCS. Fundamenta Informaticae, XVI(2):171–199, 1992.
11. D. Sangiorgi. Expressing Mobility in Process Algebras: First-Order and Higher- Order Paradigms. PhD thesis, Department of Computer Science, University of Edinburgh, 1992.
12. D. Sangiorgi. A theory of bisimulation for the π-calculus. Acta Informatica, 33:69–97, 1996.
13. D. Sangiorgi. The name discipline of uniform receptiveness. Theoretical Computer Science, 221:457–493, 1999.