A Protocol for Multi-threaded Processes with Choice in π-Calculus
DOI
オープンアクセス
説明
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.
