This paper describes a new model for dynamic distributed systems, where new processes are added and terminated at execution time. It is an extension of the static model underlying CSP. The model uses CSP I/O commands as the basic means of communications among processes, unlike the model underlying ADA, we insist that each process knows with whom it can communicate. We actually view communication as a fully symmetric operation in which values are exchanged between two processes.A problem of distributed termination arises sometimes in a distributed system. We present a new algorithm to detect distributed termination in a dynamic system. It is better than previously published solutions.