On the expressive power of KLAIM-based calculi

Theoretical Computer Science

Volumn 356, Issue 3, 2006, Pages 387-421

  De Nicola, Rocco ^a   Gorla, Daniele ^b   Pugliese, Rosario ^a  

^a UNIVERSITY OF FLORENCE   (Italy)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Behavioural equivalences; Bisimulation; Expressiveness; Language encodings; Network aware programming; Process calculi

Indexed keywords

ALGEBRA; COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTER SYSTEMS PROGRAMMING;

BEHAVIOURAL EQUIVALENCES; BISIMULATION; EXPRESSIVENESS; LANGUAGE ENCODINGS; NETWORK-AWARE PROGRAMMING; PROCESS CALCULI;

COMPUTER PROGRAMMING LANGUAGES;

EID: 33646163020     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2006.02.007     Document Type: Article

References (31)

1. Amadio R.M., Castellani I., and Sangiorgi D. On bisimulations for the asynchronous π-calculus. Theoret. Comput. Sci. 195 2 (1998) 291-324
2. Bettini L., De Nicola R., Ferrari G., and Pugliese R. Interactive mobile agents in X-KLAIM. Proc. Seventh WETICE. IEEE Computer Society, Silver Spring, MD (1998) 110-115
3. Bettini L., De Nicola R., and Pugliese R. KLAVA: a java package for distributed and mobile applications. Software-Practice Experience 32 (2002) 1365-1394
4. Bettini L., and Nicola R.D. Mobile distributed programming in x-Klaim. In: Bernardo M., and Bogliolo A. (Eds). SFM, Lecture Notes in Computer Science Vol. 3465 (2005), Springer, Berlin 29-68
5. Boreale M. On the expressiveness of internal mobility in name-passing calculi. Theoret. Comput. Sci. 195 2 (1998) 205-226
6. G. Boudol, Asynchrony and the π-calculus (note), Rapport de Recherche 1702, INRIA Sophia-Antipolis, May 1992.
7. Busi N., Gorrieri R., and Zavattaro G. Comparing three semantics for linda-like languages. Theoret. Comput. Sci. 240 1 (2000) 49-90
8. Busi N., Gorrieri R., and Zavattaro G. On the expressiveness of linda coordination primitives. Inform. and Comput. 156 1-2 (2000) 90-121
9. Cacciagrano D., and Corradini F. On synchronous and asynchronous communication paradigms. Proc. ICTCS'01, Lecture Notes in Computer Science Vol. 2202 (2001), Springer, Berlin 256-268
10. Cardelli L., and Gordon A.D. Mobile ambients. Theoret. Comput. Sci. 240 1 (2000) 177-213
11. De Nicola R., Ferrari G., and Pugliese R. KLAIM: a kernel language for agents interaction and mobility. IEEE Trans. Software Eng. 24 5 (1998) 315-330
12. De Nicola R., Ferrari G., and Pugliese R. Programming access control: the Klaim experience. Proc. CONCUR'00, Lecture Notes in Computer Science Vol. 1877 (2000), Springer, Berlin 48-65
13. R. De Nicola, D. Gorla, R. Pugliese, On the expressive power of KLAIM-based calculi, in: Proc. EXPRESS'04, ENTCS, Vol. 128, No. 2, Elsevier, Amsterdam, 2004, pp. 117-130.
14. R. De Nicola, D. Gorla, R. Pugliese, Basic observables for a calculus for global computing, Proc. ICALP'05, Vol. 3580, Springer, 2005, pp. 1226-1238.
15. De Nicola R., Gorla D., and Pugliese R. Global computing in a dynamic network of tuple spaces. Proc. COORDINATION'05, Lecture Notes in Computer Science Vol. 3454 (2005), Springer 157-172
16. De Nicola R., Gorla D., and Pugliese R. Pattern matching over a dynamic network of tuple spaces. Proc. FMOODS'05, Lecture Notes in Computer Science Vol. 3535 (2005), Springer, Berlin 1-14
17. Gelernter D. Generative communication in linda. ACM Trans. Programming Languages Systems 7 1 (1985) 80-112
18. D. Gorla, Semantic Approaches to global computing systems, Ph.D. Thesis, Dip. Sistemi ed Informatica, Univ. di Firenze, 2005.
19. Gorla D., and Pugliese R. Resource access and mobility control with dynamic privileges acquisition. Proc. ICALP'03, Lecture Notes in Computer Science Vol. 2719 (2003), Springer, Berlin 119-132
20. Hennessy M., and Riely J. Resource access control in systems of mobile agents. Inform. and Comput. 173 (2002) 82-120
21. Honda K., and Tokoro M. An object calculus for asynchronous communication. Proc. ECOOP'91, Lecture Notes in Computer Science Vol. 512 (1991), Springer, Berlin 133-147
22. Milner R. The polyadic π-calculus: a tutorial. Logic and Algebra of Specification, Series F. NATO ASI Vol. 94 (1993), Springer, Berlin
23. Milner R., Parrow J., and Walker D. A calculus of mobile processes, part I/II. Inform. and Comput. 100 (1992) 1-77
24. Nestmann U. What is a 'good' encoding of guarded choice?. Inform. and Comput. 156 (2000) 287-319
25. Nestmann U., and Pierce B.C. Decoding choice encodings. Inform. and Comput. 163 (2000) 1-59
26. Palamidessi C. Comparing the expressive power of the synchronous and the asynchronous π-calculi. Math. Struct. Comput. Sci. 13 5 (2003) 685-719
27. Parrow J. An introduction to the pi-calculus. Handbook of Process Algebra (2001), Elsevier, Amsterdam 479-543
28. Riely J., and Hennessy M. Trust and partial typing in open systems of mobile agents. Proc. POPL '99 (1999), ACM, New York 93-104
29. Sangiorgi D. Bisimulation in higher-order process calculi. Inform. and Comput. 131 (1996) 141-178
30. D. Sangiorgi, D. Walker, The π-calculus: a Theory of Mobile Processes, Cambridge University Press, Cambridge, 2001, ISBN-10: 0521781779.
31. Yoshida N. Graph types for monadic mobile processes. Proc. FST-TCS'96, Lecture Notes in Computer Science Vol. 1180 (1996), Springer, Berlin 371-386