Advertisement

Comparing Recursion, Replication, and Iteration in Process Calculi

  • Nadia Busi
  • Maurizio Gabbrielli
  • Gianluigi Zavattaro
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3142)

Abstract

In [BGZ03] we provided a discrimination result between recursive definitions and replication in a fragment of CCS by showing that termination (i.e., all computations terminate) is undecidable in the calculus with recursion, whereas it turns out to be decidable in the calculus with replication. Here we extend the results in [BGZ03] by considering iteration, a third mechanism for expressing infinite behaviours. We show that convergence (i.e., the existence of a terminating computation) is undecidable in the calculus with replication, whereas it is decidable in the calculus with iteration. We also show that recursion, replication and iteration constitute a strict expressiveness hierarchy w.r.t. weak bisimulation: namely, there exist weak bisimulation preserving encodings of iteration in replication (and of replication in recursion), whereas there exist no weak bisimulation preserving encoding in the other direction.

Keywords

Transition System Transition Rule Program Counter Discrimination Result Random Access Machine 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [BGZ03]
    Busi, N., Gabbrielli, M., Zavattaro, G.: Replication vs. Recursive Definitions in Channel Based Calculi. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 133–144. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  2. [FS01]
    Finkel, A., Schnoebelen, P.: Well-Structured Transition Systems Everywhere! Theoretical Computer Science 256, 63–92 (2001)zbMATHCrossRefMathSciNetGoogle Scholar
  3. [GSV04]
    Giambiagi, P., Schneider, G., Valencia, F.D.: On the Expressiveness of CCS-like Calculi. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol. 2987, pp. 226–240. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  4. [Hig52]
    Higman, G.: Ordering by divisibility in abstract algebras. Proc. London Math. Soc. 2, 236–366 (1952)CrossRefMathSciNetGoogle Scholar
  5. [KS90]
    Kanellakis, P.C., Smolka, S.A.: CCS expressions, finite state processes, and three problems of equivalence. Information and Computation 86(1), 43–68 (1990)zbMATHCrossRefMathSciNetGoogle Scholar
  6. [Mil89]
    Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)zbMATHGoogle Scholar
  7. [Min67]
    Minsky, M.L.: Computation: finite and infinite machines. Prentice-Hall, Englewood Cliffs (1967)zbMATHGoogle Scholar
  8. [NPV02]
    Nielsen, M., Palamidessi, C., Valencia, F.D.: On the Expressive Power of Temporal Concurrent Constraint Programming Languages. In: Proc. of PPDP 2002, ACM Press, New York (2002)Google Scholar
  9. [PT87]
    Paige, R., Tarjan, R.: Three partition refinement algorithms. SIAM Journal of Computing 16(6), 973–989 (1987)zbMATHCrossRefMathSciNetGoogle Scholar
  10. [SS63]
    Shepherdson, J.C., Sturgis, J.E.: Computability of recursive functions. Journal of the ACM 10, 217–255 (1963)zbMATHCrossRefMathSciNetGoogle Scholar
  11. [S03]
    Srba, J.: Undecidability of Weak Bisimilarity for PA-Processes. In: Ito, M., Toyama, M. (eds.) DLT 2002. LNCS, vol. 2450, pp. 197–208. Springer, Heidelberg (2003)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Nadia Busi
    • 1
  • Maurizio Gabbrielli
    • 1
  • Gianluigi Zavattaro
    • 1
  1. 1.Dipartimento di Scienze dell’InformazioneUniversità di BolognaBolognaItaly

Personalised recommendations