论文信息 - Process Calculi for Coordination: From Linda to JavaSpaces

Process Calculi for Coordination: From Linda to JavaSpaces

We present a collection of process calculi featuring coordination primitives for the shared dataspace coordination model (inspired by Linda, JavaSpaces and TSpaces), some of which have never been formally defined before. The operational semantics of the calculi is used to clarify possible ambiguities of the informal definitions of these languages, to discuss possible implementation choices, to compare the expressive power of the new primitives and, finally, to support formal reasoning about programs written with these primitives.

[1] Robin Milner,et al. Communication and concurrency , 1989, PHI Series in computer science.

[2] Jan Friso Groote,et al. Transition System Specifications with Negative Premises , 1993, Theor. Comput. Sci..

[3] C. A. R. Hoare,et al. Communicating Sequential Processes (Reprint) , 1983, Commun. ACM.

[4] Nadia Busi,et al. On the Expressiveness of Event Notification in Data-Driven Coordination Languages , 2000, ESOP.

[5] Robin Milner,et al. A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[6] Robin Milner,et al. A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[7] Tobin J. Lehman,et al. T Spaces , 1998, IBM Syst. J..

[8] Roberto Gorrieri,et al. Comparing three semantics for Linda-like languages , 2000, Theor. Comput. Sci..

[9] Nadia Busi,et al. Event notification in data-driven coordination languages: comparing the ordered and unordered interpretations , 2000, SAC '00.

[10] Roberto Gorrieri,et al. On the Expressiveness of Linda Coordination Primitives , 2000, Inf. Comput..

[11] Nicholas Carriero,et al. Coordination languages and their significance , 1992, CACM.

[12] Roberto Gorrieri,et al. A Process Algebraic View of Linda Coordination Primitives , 1998, Theor. Comput. Sci..

[13] David J. Goodman,et al. Personal Communications , 1994, Mobile Communications.