We present the first compositional proof system for checking processes
against formulas in the modal mu-calculus which is capable of handlin
g dynamic process networks. The proof system is obtained in a systemat
ic way from the operational semantics of the underlying process algebr
a. A non-trivial proof example is given, and the proof system is shown
to be sound in general, and complete for finite-state processes. (C)
1998 Academic Press.