论文信息 - On the Proof Method for Bisimulation (Extended Abstract) - 字舞流文

On the Proof Method for Bisimulation (Extended Abstract)

Davide Sangiorgi | D. Sangiorgi

[1] Didier Caucal,et al. Graphes canoniques de graphes algébriques , 1990, RAIRO Theor. Informatics Appl..

[2] Davide Sangiorgi,et al. Expressing mobility in process algebras : first-order and higher-order paradigms , 1993 .

[3] Xinxin Liu,et al. Compositionality through an Operational Semantics of Contexts , 1990, J. Log. Comput..

[4] S. Abramsky. The lazy lambda calculus , 1990 .

[5] Robert de Simone,et al. Higher-Level Synchronising Devices in Meije-SCCS , 1985, Theor. Comput. Sci..

[6] Jan Friso Groote,et al. Structured Operational Semantics and Bisimulation as a Congruence , 1992, Inf. Comput..

[7] A. Meyer,et al. Bisimulation can't be traced. Preliminary report , 1987 .

[8] Robin Milner,et al. A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[9] Robin Milner,et al. Co-Induction in Relational Semantics , 1991, Theor. Comput. Sci..

[10] Jan Friso Groote. Transition System Specifications with Negative Premises (Extended Abstract) , 1990, CONCUR.

[11] Robin Milner,et al. Communication and concurrency , 1989, PHI Series in computer science.

[12] Albert R. Meyer,et al. Bisimulation can't be traced , 1988, POPL '88.

[13] Robin Milner,et al. A Calculus of Mobile Processes, II , 1992, Inf. Comput..