Coordinating mobile agents via blackboards and access rights

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1282, Issue , 1997, Pages 220-237

  De Nicola, Rocco ^a   Ferrari, Gianluigi ^b   Pugliese, Rosario ^a  

^a UNIVERSITY OF FLORENCE   (Italy)

^b UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ACCESS RIGHTS; COMPUTING ENVIRONMENTS; PROGRAMMING PARADIGMS; TYPE SYSTEMS;

MOBILE AGENTS;

EID: 84957074415     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63383-9_83     Document Type: Conference Paper

References (22)

1. N. Busi, R. Gorrieri, G. Zavattaxo. A Process Algebraic View of Linda Coordination Primitives. Theoretical Computer Science, (to appear)
2. L. Cardelli. A language with distributed scope. Computing Systems, 8(1):27–59, MIT Press, 1995.
3. N. Carriero, D. Gelernter. Linda in Context. Communications of the ACM, 32(4):444–458, 1989.
4. P. Ciancarini, R. Gorrieri, G. Zavattaro. Towards a Calculus for Generative Communication. Proc. FMOODS'96, pp.283–297, Chapman & Hall, 1996.
5. P. Ciancarini, K.K. Jensen, D. Yankelevich. On the Operational Semantics of a Coordination Language. Proc. Object-Based Models and Languages for Concurrent Systems, LNCS 924, pp.77–106, Springer, 1995.
6. R. De Nicola, G.-L. Ferrari, R. Pugliese. Locality based Linda: programming with explicit localities. Proc. TAPSOFT'97, LNCS 1214, pp.712–726, Springer, 1997.
7. R. De Nicola, R. Pugliese. A Process Algebra based on Linda. Proc. COORDINATION'96, LNCS 1061, pages 160–178, Springer, 1996.
8. D. Gelernter. Generative Communication in Linda. ACM Transactions on Programming Languages and Systems, 7(1):80–112, 1985.
9. A. Giacalone, P. Mishra, S. Prasad. Facile: A symmetric integration of concurrent and functional programming. Int. Journal of Parallel Programming, 18(2), 1989.
10. A. Ingolfsdottir. Semantic Models for Communicating Processes with Value-Passing. Ph.D. Thesis, University of Edinburgh, 1994.
11. N. Kobayashi, B. Pierce and D. Turner. Linearity and the π-calculus. In Proc. POPL'96, 1996.
12. R. Milner. Communication and Concurrency. Prentice Hall Int., 1989.
13. R. Milner, J. Parrow, D. Walker. A calculus of mobile processes, (Part I and II). Information and Computation, 100:1–77, 1992.
14. B. Pierce and D. Sangiorgi. Typing and subtyping for mobile processes. Proc. LICS'93, IEEE-Press, 1993 (to appear in Mathematical Struct, in Comp. Science)
15. G.D. Plotkin. Lectures notes in domain theory. University of Edinburgh, 1983.
16. R. Pugliese. Semantic Theories for Asynchronous Languages. Ph.D. Thesis VIII-96–6, Univ. di Roma "La Sapienza", Dip. Scienze dell'Informazione, 1996.
17. J. Reppy. Higher Order Concurrency. Ph.D. Thesis, Cornell University, 1992.
18. Sun Microsystems. The Java Language: A white paper. White Paper, 1994.
19. B. Thomsen, L. Leth, A. Giacalone. Some Issues in the Semantics of Facile Distributed Programming. REX Workshop "Semantics: Foundations and Applications", LNCS 666, Springer, 1992.
20. D. Volpano, G. Smith. A typed-based approach to program security. Proc. TAPSOFT'97, LNCS 1214, pp.607–621, Springer, 1997.
21. J.E. White. Telescript Technology: The Foundation for the Electronic Market Place. General Magic White Paper, 1994.
22. General Magic. Telescript Technology: Mobile Agents. White Paper, 1996.