论文信息 - Complete Proof Systems for Observation Congruences in Finite-Control pi-Calculus

Complete Proof Systems for Observation Congruences in Finite-Control pi-Calculus

Proof systems for weak bisimulation congruences in the finite-control π-calculus are presented and their completeness proved. This study consists of two major steps: first complete proof systems for guarded recursions arc obtained; then sound laws sufficient to remove any unguarded recursions are formulated. These results lift Milner's axiomatisation for observation congruence in regular pure-CCS to the π-calculus. The completeness proof relies on the symbolic bisimulation technique.

Huimin Lin

[1] Mads Dam. Model Checking Mobile Processes , 1993, CONCUR.

[2] Robin Milner,et al. A Complete Axiomatisation for Observational Congruence of Finite-State Behaviors , 1989, Inf. Comput..

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

[4] Davide Sangiorgi,et al. Algebraic Theories for Name-Passing Calculi , 1995, Inf. Comput..

[5] Huimin Lin,et al. Unique Fixpoint Induction for Mobile Processes , 1995, CONCUR.

[6] H. Lin. Symbolic Bisimulations and Proof Systems for the , 1994 .

[7] Robin Milner,et al. A Complete Inference System for a Class of Regular Behaviours , 1984, J. Comput. Syst. Sci..

[8] Rocco De Nicola,et al. A Symbolic Semantics for the π-calculus , 1994 .

[9] Huimin Lin. Complete Inference Systems for Weak Bisimulation Equivalences in the pi-Calculus , 1995, TAPSOFT.

[10] Davide Sangiorgi,et al. Algebraic Theories for Name-Passing Calculi , 1993, Inf. Comput..

[11] Matthew Hennessy,et al. Symbolic Bisimulations , 1995, Theor. Comput. Sci..

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