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

Authors:
Kazunori Iwata;Shingo Itabashi;Naohiro Ishii
Affiliations:
-;-;-
Venue:
ICCS '01 Proceedings of the International Conference on Computational Science-Part II
Year:
2001

Citing 7
Cited 0

Synchronization of asynchronous processes in CSP

ACM Transactions on Programming Languages and Systems (TOPLAS)
Principles of concurrent and distributed programming

Principles of concurrent and distributed programming
A semantics for ML concurrency primitives

POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An Effective Implementation for the Generalized Input-Output Construct of CSP

ACM Transactions on Programming Languages and Systems (TOPLAS)
Communicating sequential processes

Communications of the ACM
Concurrent Objects in a Process Calculus

TPPP '94 Proceedings of the International Workshop on Theory and Practice of Parallel Programming
Nepi: A Network Programming Language Based on the pi-Calculus

COORDINATION '96 Proceedings of the First International Conference on Coordination Languages and Models

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.