More on bisimulations for higher order π-calculus

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

Volumn 3921 LNCS, Issue , 2006, Pages 63-78

  Cao, Zining ^a  

^a NANJING UNIVERSITY OF AERONAUTICS AND ASTRONAUTICS   (China)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; EQUIVALENCE CLASSES; INDEXING (OF INFORMATION);

BISIMULATION; INDEXED BISIMULATIONS;

DIFFERENTIATION (CALCULUS);

EID: 33745771003     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11690634_5     Document Type: Conference Paper

References (9)

1. Z. Cao. A uniform reduction equivalence for process calculi, In Proc. APLAS'04, Lecture Notes in Computer Science 3302, 179-195. Springer-Verlag, 2004.
2. A. Jeffrey, J. Rathke. A theory of bisimulation for a fragment of concurrent ML with local names. Theoretical Computer Science. 323:1-48, 2004.
3. A. Jeffrey, J. Rathke. Contextual equivalence for higher-order π-calculus revisited. Logical Methods in Computer Science, 1(1:4):1-22, 2005.
4. Y. Li, X. Liu: Towards a theory of bisimulation for the higher-order process calculi. Journal of Computer Science and Technology. 19(3): 352-363, 2004.
5. R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, (Part I and II). Information and Computation, 100:1-77, 1992.
6. D. Sangiorgi. Expressing mobility in process algebras: first-order and higher-order paradigms, Ph.D thesis, University of Einburgh, 1992.
7. D. Sangiorgi. Bisimulation in higher-order calculi, Information and Computation, 131(2):141-178, 1996.
8. D. Sangiorgi, D. Walker. The π-calculus: a theory of mobile processes, Cambridge University Press, 2001.
9. B. Thomsen. Plain CHOCS, a second generation calculus for higher order processes, Acta Information, 30:1-59, 1993.