Expired data collection in shared dataspaces

Theoretical Computer Science

Volumn 298, Issue 3, 2003, Pages 529-556

  Busi, Nadia ^a   Zavattaro, Gianluigi ^a  

^a UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA ACQUISITION; INFORMATION MANAGEMENT; JAVA PROGRAMMING LANGUAGE; MATHEMATICAL MODELS; MIDDLEWARE;

DATA COLLECTION; DATASPACES;

COMPUTER SCIENCE;

EID: 0037432680     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00867-8     Document Type: Conference Paper

References (21)

1. Aziz Abdulla P., Jonsson B. Verifying programs with unreliable channels. Inform. and Comp. 127(2):1996;91-101.
2. Baeten J.C.M., Middelburg C.A. Process algebra with timing. real time and discrete time Bergstra J.A., Ponse A., Smolka S.A. Handbook of Process Algebra. 2001;Elsevier, Amsterdam.
3. Berger M., Honda K. The two-phase commit protocol in an extended. π-calculus Proc. Express'00, Electronic Notes in Theoretical Computer Science. Vol. 39:2000;Elsevier, Amsterdam.
4. Busi N., Gorrieri R., Zavattaro G. On the expressiveness of Linda coordination primitives. Inform. and Comput. 156(1/2):2000;90-121.
5. Busi N., Gorrieri R., Zavattaro G. Process calculi for coordination. from Linda to JavaSpaces Proc. AMAST2000, Lecture Notes in Computer Science. Vol. 1816:2000;198-212 Springer, Berlin.
6. Busi N., Gorrieri R., Zavattaro G. Temporary data in shared dataspace coordination languages. Proc. FOSSACS'01. Lecture Notes in Computer Science. Vol. 2030:2001;121-136 Springer, Berlin.
7. de Boer F.S., Gabbrielli M., Meo M.C. A timed Linda language. Proc. Coordination'00. Lecture Notes in Computer Science. Vol. 1906:2000;299-304 Springer, Berlin.
8. Dufourd C., Finkel A., Schnoebelen P. Reset nets between decidability and undecidability. Proc. ICALP'98. Lecture Notes in Computer Science. Vol. 1061:1998;103-115 Springer, Berlin.
9. Gelernter D. Generative communication in Linda. ACM Trans. Program. Languages Systems. 7(1):1985;80-112.
10. Gelernter D., Carriero N. Coordination languages and their significance. Commun. ACM. 35(2):1992;97-107.
11. Jacquet J.M., De Bosschere K., Brogi A. On timed coordination languages. Proc. Coordination'00. Lecture Notes in Computer Science. Vol. 1906:2000;81-98 Springer, Berlin.
12. Milner R. Communication and Concurrency. 1989;Prentice-Hall, Englewood Cliffs, NJ.
13. Minsky M.L. Computation. Finite and Infinite Machines:1967;Prentice-Hall, Englewood Cliffs, NJ.
14. Moller F., Tofts C. A temporal calculus of communicating systems. Proc. Concur'90. Lecture Notes in Computer Science. Vol. 458:1990;467-480 Springer, Berlin.
15. Moller F., Tofts C. Relating processes with respect to speed. Proc. Concur'91. Lecture Notes in Computer Science. Vol. 527:1991;424-438 Springer, Berlin.
16. Nicollin X., Sifakis J. The algebra of timed processes, ATP. theory and application Inform. and Comput. 114(1):1994;131-178.
17. Shepherdson J.C., Sturgis J.E. Computability of recursive functions. J. ACM. 10:1963;217-255.
18. Satoh I., Tokoro M. A formalism for remotely interacting processes. Proc TPPP'94. Lecture Notes in Computer Science. Vol. 907:1994;216-228 Springer, Berlin.
19. Sun Microsystem, Inc. Jini Distributed Leasing Specifications, 1998.
20. Sun Microsystem, Inc. JavaSpaces Specifications, 1998.
21. Wyckoff P., McLaughry S.W., Lehman T.J., Ford D.A. T Spaces. IBM Systems J. 37(3):1998.