论文信息 - A Protocol for Multi-Threaded Processes with Choice in pi-Calculus

A Protocol for Multi-Threaded Processes with Choice in pi-Calculus

We have proposed a new protocol for the multithreaded processes with choice written in ?-calculus[1,2]. This protocol frees the multi-threaded processes from deadlock. It has been defined as transition rules. We have shown why the protocol avoids the deadlock in the multithreaded processes.

[1] Ken Mano,et al. Nepi: A Network Programming Language Based on the pi-Calculus , 1996, COORDINATION.

[2] Robin Milner,et al. A semantics for ML concurrency primitives , 1992, POPL '92.

[3] Abraham Silberschatz,et al. An Effective Implementation for the Generalized Input-Output Construct of CSP , 1983, TOPL.

[4] Robin Milner,et al. The Polyadic π-Calculus: a Tutorial , 1993 .

[5] C. A. R. Hoare,et al. Communicating sequential processes , 1978, CACM.

[6] Munindar P. Singh. Applying the Mu-Calculus in Planning and Reasoning about Action , 1998, J. Log. Comput..

[7] Ken Mano,et al. Nepi²: A Two-Level Calculus for Network Programming Based on the pi-Calculus , 1997, ASIAN.

[8] Rajive L. Bagrodia,et al. Synchronization of asynchronous processes in CSP , 1989, ACM Trans. Program. Lang. Syst..

[9] Mordechai Ben-Ari,et al. Principles of concurrent and distributed programming , 2005, PHI Series in computer science.

[10] Benjamin C. Pierce,et al. Concurrent Objects in a Process Calculus , 1994, Theory and Practice of Parallel Programming.

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