Complete inference systems for weak bisimulation equivalences in the π-calculus

Information and Computation - Tập 180 - Trang 1-29 - 2003
Huimin Lin1
1Laboratory for Computer Science, Institute of Software, Chinese Academy of Sciences, P.O. Box 8718, Beijing 100080, PR China

Tài liệu tham khảo

Boreale, 1995, Testing equivalences for mobile processes, Inf. Comput., 120, 279, 10.1006/inco.1995.1114 Boreale, 1996, A symbolic semantics for the π-calculus, Inf. Comput., 126, 34, 10.1006/inco.1996.0032 Ferrari, 1995, The weak late π-calculus semantics as observation equivalence, vol. 962 M. Hennessy, A model for the π-calculus, Technical Report 8/91, CSAI, University of Sussex, 1991 Hennessy, 1995, Symbolic bisimulations, Theoret. Comput. Sci., 138, 353, 10.1016/0304-3975(94)00172-F Hennessy, 1996, Proof systems for message-passing process algebras, Formal Aspects Comput., 8, 379, 10.1007/BF01213531 H. Lin, Symbolic bisimulations and proof systems for the π-calculus, Report ISCAS-LCS-94-06, Laboratory for Computer Science, Institute of Software, Chinese Academy of Sciences, 1994 Liu, 1994, Characterizing bisimulation congruence in the π-calculus, vol. 836 Milner, 1989 Milner, 1992, A calculus of mobile processes, part I, II, Inf. Comput., 100, 1, 10.1016/0890-5401(92)90008-4 Milner, 1993, Modal logics for mobile processes, Theoret. Comput. Sci., 114, 149, 10.1016/0304-3975(93)90156-N Parrow, 1995, Algebraic theories for name-passing calculi, Inf. Comput., 120, 174, 10.1006/inco.1995.1108 Sangiorgi, 1996, A theory of bisimulation for the π-calculus, Acta Inf., 33, 69, 10.1007/s002360050036 Walker, 1994, On bisimulation in the π-calculus, vol. 836