Towards a theory of bisimulation for the higher-order process calculi

Journal of Computer Science and Technology

Volumn 19, Issue 3, 2004, Pages 352-363

  Li, Yong Jian ^a   Liu, Xin Xin ^a  

^a INSTITUTE OF SOFTWARE   (China)

Author keywords

Barbed bisimulation; Context bisimulation; Higher order process; Labelled transition semantics

Indexed keywords

COMPUTER SCIENCE; COMPUTER SIMULATION; INTEGRODIFFERENTIAL EQUATIONS; MATHEMATICAL MODELS; PROBLEM SOLVING; SYNTACTICS;

BARBED BISIMULATION; CONTEXT-BISIMULATION; HIGHER ORDER PROCESS CALCULI; LABELLED TRANSITION SEMANTICS; MATHEMATICAL DERIVATIVES; THEORY OF BISIMULATION;

SEMANTICS;

EID: 2442697652     PISSN: 10009000     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02944905     Document Type: Article

References (18)

1. Milner R. Caculus of communicating systems. LNCS 92, Springer Verlag, 1980.
2. Park D. Concurrency and automata on infinite sequences. LNCS 104, Springer Verlag, 1981.
3. Milner R. Communication and Concurrency. Prentice Hall, 1989.
4. Milner R, Parrow J, Walker D. A calculus of mobile processes, (Parts I and II). Information and Computation, 1992, 100(1): 1-40.
5. Sangiorgi D. Expressing mobility in process algebras: First-order and higher-order paradigms [Dissertation]. University of Edinburgh, Edinburgh, U.K, 1992.
6. Thomsen B. Calculus for high order communicating systems [Dissertation]. Department of Computing, Imperial College, 1990.
7. Astesiano E, Giovini A. Generalized bisimulation in relational specifications. LNCS 294, Springer-Verlage, pp.207-266.
8. Boudol G. Towards a lambda calculus for concurrent and communicating systems. LNCS 351, Springer-Verlag, Barcelona, Spain, March 13-17, 1989, pp.149-161.
9. Peter Sewell. From rewrite rules to bisimulation congruences. In Proc. Concur'98, LNCS 1466, Springer Verlag, Nice, France, 1998, pp.269-284.
10. Milner R. The polyadic π-calculus: A tutorial. In Proc. the International Summer School on Logic and Algebra of Specification, 1991.
11. Sangiorgi D, Walker D. The π-Calculus: A Theory of Mobile Processes. Cambridge University Press, 2001, pp.42-43.
12. Kohei Honda, Nobuko Yoshida. On reduction-based process semantics. Theoretical Computer Science, 1995, 152(2): 437-486.
13. Fournet C, Gonthier G. A hierarchy of equivalence for asynchronous calculi. In Proc. International Colloquium on Algorithms, Language and Programming, LNCS 1443, Springer-Verlag, Aalborg, Denmark, July 13-17, 1998, pp.844-855.
14. Sangiorgi D. Bisimulation for higher-order process calculi. Information and Computation, 1996, 131(2): 141-178.
15. Liu Xinxin, Li Yongjian. Bisimulation for higher-order π-calculus. In Proc. the Third Asian Workshop on Programming Language and Systems (Aplas'03), 2002.
16. Alan Jeffery, Julian Rathke. A theory of bisimulation for a fragment of concurrent CML with local names. In Proc. Logic in Computer Science, IEEE CS Press, Santa Barbara, California, June 26-28, 2000, pp.311-321.
17. Luca Cardelli, Andrew D Gordon. Mobile ambients. In Proc. Foundations of Software Science and Computation Structures (FossaCs), ETAPS'98, LNCS 1378, Portugal, Springer-Verlag, 1998, pp.140-155.
18. Cedric Fournet, Georeges Gonthier. The reflexive cham and the join-calculus. In Proc. the 23rd Annual ACM Symposium on Principles of Programming Languages, 1996, pp.372-385.