A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
We investigate the expressive power of three alternative approaches for the definition of infinite behaviors in process calculi, namely, recursive definitions, replication and iteration. We prove several discrimination results between the calculi obtained from a core CCS by adding the three mechanisms mentioned above. These results are obtained by considering the decidability of four basic properties: termination (i.e. all computations are finite), convergence (i.e. the existence of a finitedoi:10.1017/s096012950999017x fatcat:eig4d6er6ndebodb4shkkrkhiy