A Protocol for Multi-threaded Processes with Choice in π-Calculus

DOI Open Access

Description

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.

Details 詳細情報について

Report a problem

Back to top