On Boundedness in Depth in the π-Calculus
We investigate the class $procBD$ of π-Calculus processes that are bounded in the function depth. First, we show that boundedness in depth has an intuitive characterisation when we understand processes as graphs: a process is bounded in depth if and only if the length of the simple paths is bounded. The proof is based on a new normal form for the π-Calculus called anchored fragments. Using this concept, we then show that processes of bounded depth have well-structured transition systems (WSTS). As a consequence, the termination problem is decidable for this class of processes. The instantiation of the WSTS framework employs a new well-quasi-ordering for processes in $procBD$.
- 12.A. Habel. Hyperedge Replacitent: Grammars and Languages, volume 643 of LNCS. Springer-Verlag, 1992.Google Scholar
- 14.R. Meyer. A theory of structural stationarity in the π-calculus. Under revision, 2008.Google Scholar
- 17.R. Milner. Communicating and Mobile Systits: the π-Calculus. Cambridge University Press, 1999.Google Scholar
- 18.D. Sangiorgi and D. Walker. The π-calculus: a Theory of Mobile Processes. Cambridge University Press, 2001.Google Scholar