On the Expressive Power of Restriction and Priorities in CCS with Replication

• Authors: Jesús Aranda;Frank D. Valencia;Cristian Versari
• Venue: FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
• Year: 2009

We study the expressive power of restriction and its interplay with replication. We do this by considering several syntactic variants of CCS! (CCS with replication instead of recursion) which differ from each other in the use of restriction with respect to replication. We consider three syntactic variations of CCS! which do not allow the use of an unbounded number of restrictions: CCS$_{!}^{-!\nu}$ is the fragment of CCS! not allowing restrictions under the scope of a replication. CCS$_{!}^{-\nu}$ is the restriction-free fragment of CCS! . The third variant is CCS$_{!+pr}^{-!\nu}$ which extends CCS$_{!}^{-!\nu}$ with Phillips' priority guards. We show that the use of unboundedly many restrictions in CCS! is necessary for obtaining Turing expressiveness in the sense of Busi et al [8]. We do this by showing that there is no encoding of RAMs into CCS$_{!}^{-!\nu}$ which preserves and reflects convergence. We also prove that up to failures equivalence, there is no encoding from CCS! into CCS$_{!}^{-!\nu}$ nor from CCS$_{!}^{-!\nu}$ into CCS$_{!}^{-\nu}.$ As lemmata for the above results we prove that convergence is decidable for CCS$_{!}^{-!\nu}$ and that language equivalence is decidable for CCS$_{!}^{-\nu}$. As corollary it follows that convergence is decidable for restriction-free CCS. Finally, we show the expressive power of priorities by providing an encoding of RAMs in CCS$_{!+pr}^{-!\nu}$.