Communication problems in the π-calculus

Abstract

In this paper we deal with the notions of deadlock, starvation, and communication errors in the asynchronous polyadic π-calculus. We show that detecting deadlock or starvation in a given specification in π-calculus is an undecidable problem. We also extend the proof of undecidability of the notion of communication errors in the polyadic π-calculus presented in [14].