CCS expressions finite state processes, and three problems of equivalence
Information and Computation
A calculus of mobile processes, I
Information and Computation
Computability of Recursive Functions
Journal of the ACM (JACM)
Well-structured transition systems everywhere!
Theoretical Computer Science
Communication and Concurrency
On the expressive power of temporal concurrent constraint programming languages
Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming
Computation: finite and infinite machines
Computation: finite and infinite machines
Undecidability of weak bisimilarity for PA-processes
DLT'02 Proceedings of the 6th international conference on Developments in language theory
Replication vs. recursive definitions in channel based calculi
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
On the expressive power of process interruption and compensation
Mathematical Structures in Computer Science
On the Expressiveness of Forwarding in Higher-Order Communication
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
On the computational power of BlenX
Theoretical Computer Science
Turing universality of the biochemical ground form
Mathematical Structures in Computer Science
On the expressiveness and decidability of higher-order process calculi
Information and Computation
FMOODS'11/FORTE'11 Proceedings of the joint 13th IFIP WG 6.1 and 30th IFIP WG 6.1 international conference on Formal techniques for distributed systems
The decidability of the reachability problem for CCS!
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Decidability of behavioral equivalences in process calculi with name scoping
FSEN'11 Proceedings of the 4th IPM international conference on Fundamentals of Software Engineering
Information and Computation
| Hi-index | 0.01 |
In this paper we investigate the expressive power of three alternative approaches to the definition of infinite behaviours in process calculi, namely, recursive definitions, replication and iteration. We prove several results discriminating between the calculi obtained from a core CCS by adding the three mechanisms mentioned above. These results are derived by considering the decidability of four basic properties: termination (that is, all computations are finite); convergence (that is, the existence of a finite computation); barb (that is, the ability to perform an action on a given channel) and weak bisimulation. Our results, which are summarised in Table 1, show that the three calculi form a strict expressiveness hierarchy in that: all the properties mentioned are undecidable in CCS with recursion; only termination and barb are decidable in CCS with replication; all the properties are decidable in CCS with iteration. As a corollary, we also obtain a strict expressiveness hierarchy with respect to weak bisimulation, since there exist weak bisimulation preserving encodings of iteration in replication and of replication in recursion, whereas there are no weak bisimulation preserving encodings in the other directions.