Advertisement

On Recursion, Replication and Scope Mechanisms in Process Calculi

  • Jesús Aranda
  • Cinzia Di Giusto
  • Catuscia Palamidessi
  • Frank D. Valencia
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4709)

Abstract

In this paper we shall survey and discuss in detail the work on the relative expressiveness of recursion and replication in various process calculi. Namely, CCS, the π-calculus, the Ambient calculus, Concurrent Constraint Programming and calculi for Cryptographic Protocols. We shall give evidence that the ability of expressing recursive behaviour via replication often depends on the scoping mechanisms of the given calculus which compensate for the restriction of replication.

Keywords

Turing Machine Expressive Power Process Calculus Reduction Semantic Static Scope 
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. [ADNV07]
    Aranda, J., Di Giusto, C., Nielsen, M., Valencia, F.: On the Expressiveness of CCS with Replication. Technical Report, LIX Ecole Polytechnique (2007), URL www.cs.unibo.it/~digiusto/research/ccsrep.pdf
  2. [BG92]
    Berry, G., Gonthier, G.: The Esterel synchronous programming language: design, semantics, implementation. Science of Computer Programming 19(2), 87–152 (1992)zbMATHCrossRefGoogle Scholar
  3. [BCMS01]
    Burkart, O., Caucal, D., Moller, F., Steffen, B.: Verification on infinite structures. In: Handbook of process algebra, vol. 9, pp. 545–623. Elsevier, North-Holland (2001)Google Scholar
  4. [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, Springer, Heidelberg (2003)CrossRefGoogle Scholar
  5. [BGZ04]
    Busi, N., Gabbrielli, M., Zavattaro, G.: Comparing recursion, replication, and iteration in process calculi. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, Springer, Heidelberg (2004)Google Scholar
  6. [BZ04]
    Busi, N., Zavattaro, G.: On the expressive power of movement and restriction in pure mobile ambients. Theoretical Computer Science 322(3), 477–515 (2004)zbMATHCrossRefMathSciNetGoogle Scholar
  7. [BZ05]
    Busi, N., Zavattaro, G.: Personal Communication (May 2005)Google Scholar
  8. [CG98]
    Cardelli, L., Gordon, A.: Mobile Ambients. In: Nivat, M. (ed.) ETAPS 1998 and FOSSACS 1998. LNCS, vol. 1378, pp. 140–155. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  9. [EN86]
    Engberg, U., Nielsen, M.: A calculus of communicating systems with label-passing. Technical report, University of Aarhus (1986)Google Scholar
  10. [Gir87]
    Girard, J.-Y.: Linear logic. Theor. Comput. Sci. 50, 1–102 (1987)zbMATHCrossRefMathSciNetGoogle Scholar
  11. [GSV04]
    Giambiagi, P., Schneider, G., Valencia, F.: On the expressiveness of infinite behavior and name scoping in process calculi. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol. 2987, pp. 226–240. Springer, Heidelberg (2004)Google Scholar
  12. [Gre78]
    Greibach, S.A.: Remarks on Blind and Partially Blind One-Way Multicounter Machines. Theor. Comput. Sci. 7, 311–324 (1978)zbMATHCrossRefMathSciNetGoogle Scholar
  13. [HS05]
    Huttel, H., Srba, J.: Recursion vs. replication in simple cryptographic protocols. In: Vojtáš, P., Bieliková, M., Charron-Bost, B., Sýkora, O. (eds.) SOFSEM 2005. LNCS, vol. 3381, pp. 175–184. Springer, Heidelberg (2005)Google Scholar
  14. [LS03]
    Levi, F., Sangiorgi, D.: Mobile safe ambients. ACM Transactions on Programming Languages and Systems 25(1), 1–69 (2003)CrossRefGoogle Scholar
  15. [Mil89]
    Milner, R.: Communication and Concurrency. International Series in Computer Science. Prentice Hall, Englewood Cliffs (1989) (SU Fisher Research 511/24)zbMATHGoogle Scholar
  16. [Mil93]
    Milner, R.: The polyadic π-calculus: A tutorial. In: Bauer, F.L, Brauer, W., Schwichtenberg, H. (eds.) Logic and Algebra of Specification, pp. 203–246. Springer, Berlin (1993)Google Scholar
  17. [Mil99]
    Milner, R.: Communicating and Mobile Systems: the π-calculus. Cambridge University Press, Cambridge (1999)Google Scholar
  18. [MP03]
    Maffeis, S., Phillips, I.: On the computational strength of pure ambient calculi. In: EXPRESS’03 (2003)Google Scholar
  19. [MPW92]
    Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes, Part I + II. Information and Computation 100(1), 1–77 (1992)zbMATHCrossRefMathSciNetGoogle Scholar
  20. [NPV02]
    Nielsen, M., Palamidessi, C., Valencia, F.: On the expressive power of concurrent constraint programming languages. In: Proc. of the 4th International Conference on Principles and Practice of Declarative Programming (PPDP 2002), pp. 156–167. ACM Press, New York (2002)CrossRefGoogle Scholar
  21. [Pal97]
    Palamidessi, C.: Comparing the expressive power of the synchronous and the asynchronous pi-calculus. In: POPL’97, pp. 256–265. ACM Press, New York (1997)Google Scholar
  22. [PV05]
    Palamidessi, C., Valencia, F.: Recursion vs Replication in Process Calculi. In: Bulletin of the EATCS vol. 87, pp. 105–125 (2005)Google Scholar
  23. [Pet81]
    Peterson, J.L.: Petri Net Theory and the Modeling of Systems. Prentice Hall PTR, Englewood Cliffs (1981)Google Scholar
  24. [SJG94]
    Saraswat, V., Jagadeesan, R., Gupta, V.: Foundations of timed concurrent constraint programming. In: Proc. of the Ninth Annual IEEE Symposium on Logic in Computer Science, July 4-7, 1994, pp. 71–80. IEEE Computer Society Press, Los Alamitos (1994)CrossRefGoogle Scholar
  25. [SW01]
    Sangiorgi, D., Walker, D.: The π−calculus: A Theory of Mobile Processes. Cambridge University Press, Cambridge (2001)Google Scholar
  26. [San05]
    Sangiorgi, D.: Personal Communication (May 2005)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Jesús Aranda
    • 1
  • Cinzia Di Giusto
    • 2
  • Catuscia Palamidessi
    • 3
  • Frank D. Valencia
    • 4
  1. 1.Universidad del Valle CaliColombia and LIX École PolytechniqueFrance
  2. 2.Dip. Scienze dell’InformazioneUniversità di BolognaItaly
  3. 3.INRIA-LIXÉcole PolytechniqueFrance
  4. 4.CNRS - LIXÉcole PolytechniqueFrance

Personalised recommendations