A process algebraic view of shared dataspace coordination

Anderson, 1991, Persistent Linda: Linda + Transactions + Query, vol. 574, 93 Banâtre, 1993, Programming by multiset transformation, Commun. ACM, 36, 98, 10.1145/151233.151242 Berger, 2000, The Two-Phase Commit Protocol in an extended π-calculus, vol. 39 Berry, 1992, The chemical abstract machine, Theoret. Comput. Sci., 96, 217, 10.1016/0304-3975(92)90185-I deBoer, 2000, A timed Linda language, vol. 1906, 299 de Boer, 1991, Embedding as a tool for language comparison: on the CSP hierarchy, vol. 527, 127 Brogi, 1997, Modeling coordination via asynchronous communication, vol. 1282, 238 Brogi, 1999, On the expressiveness of coordination models, vol. 1594, 134 N. Busi, Petri Nets with Inhibitor and Read Arcs: Semantics, Analysis and Application to Process Calculi, Ph.D. Thesis, Department of Mathematics, University of Siena, Italy, 1998. Busi, 1998, A process algebraic view of Linda coordination primitives, Theoret. Comput. Sci., 192, 167, 10.1016/S0304-3975(97)00149-7 Busi, 2000, Comparing three semantics for Linda-like languages, Theoret. Comput. Sci., 240, 49, 10.1016/S0304-3975(99)00227-3 Busi, 2000, On the expressiveness of Linda coordination primitives, Inform. and Comput., 156, 90, 10.1006/inco.1999.2823 Busi, 2000, Process calculi for coordination: from Linda to JavaSpaces, vol. 1816, 198 N. Busi, R. Gorrieri, G. Zavattaro, On the expressiveness of distributed leasing in Linda-like coordination languages, Technical Report UBLCS-2000-5, Department of Computer Science, University of Bologna, Italy, May 2000. Busi, 2001, Temporary data in shared-dataspace coordination, vol. 2030, 121 Busi, 2002, State- and event-based reactive programming in shared dataspaces, vol. 2315, 111 Busi, 2000, Event notification in data-driven coordination languages: comparing the ordered and unordered interpretations, 233 Busi, 2000, On the expressiveness of event notification in data-driven coordination languages, vol. 1782, 41 Cabri, 1998, Reactive Tuple spaces for mobile agent coordination, vol. 1477, 237 Cheng, 1995, Complexity results for 1-safe nets, Theoret. Comput. Sci., 147, 117, 10.1016/0304-3975(94)00231-7 Ciancarini, 1995, On the operational semantics of a coordination language, vol. 924, 77 De Nicola, 1984, Testing equivalences for processes, Theoret. Comput. Sci., 34, 83, 10.1016/0304-3975(84)90113-0 De Nicola, 1998, KLAIM: a kernel language for agents interaction and mobility, IEEE Trans. Software Eng., 24, 315, 10.1109/32.685256 De Nicola, 1996, A process algebra based on Linda, vol. 1061, 160 Gelernter, 1985, Generative communication in Linda, ACM Trans. Program. Lang. Syst., 7, 80, 10.1145/2363.2433 Gelernter, 1992, Coordination languages and their significance, Commun. ACM, 35, 97, 10.1145/129630.129635 Groote, 1993, Transition system specifications with negative premises, Theoret. Comput. Sci., 118, 263, 10.1016/0304-3975(93)90111-6 Hankin, 1993, A calculus of Gamma programs, vol. 757, 342 Hoare, 1985 Jacquet, 2000, On timed coordination languages, vol. 1906, 81 T. Kielmann, Objective Linda: A Coordination Model for Object-Oriented Parallel Programming, Ph.D. Thesis, Dept. of Electrical Engineering and Computer Science, University of Siegen, Germany, 1997. Malone, 1994, The interdisciplinary study of coordination, ACM Comput. Surveys, 26, 87, 10.1145/174666.174668 M. Mamei, F. Zambonelli, L. Leonardi, Tuples on the air: a middleware for context-aware computing in dynamic networks, in: Proceedings of the International Workshop on Mobile Computing Middleware, 2003, pp. 342–347. R. Menezes, R. Tolksdorf, A new approach to scalable Linda-systems based on swarms, in: Proceedings of ACM Symposium on Applied Computing, SAC 2003, Melbourne, FL, USA. Milner, 1989 Milner, 1992, A calculus of mobile processes, Inform. and Comput., 100, 1, 10.1016/0890-5401(92)90008-4 Moller, 1990, A temporal calculus of communicating systems, vol. 458, 467 Sun Microsystem, Inc., JavaSpaces Specifications 1.1, 1999. Sun Microsystem, Inc., Jini Distributed Leasing Specifications, 1998. Omicini, 1998, Coordination of mobile information agents in TuCSoN, J. Internet Res., 8, 10.1108/10662249810241266 Palamidessi, 2003, Comparing the expressive power of the synchronous and the asynchronous π-calculus, Math. Structures Comput. Sci., 13, 685, 10.1017/S0960129503004043 Papadopoulos, 1998, Coordination models and languages, Adv. Comput., 46, 329, 10.1016/S0065-2458(08)60208-9 G.P. Picco, A.L. Murphy, G.-C. Roman, Lime: Linda meets mobility, in: Proceedings of the 21st ICSE, 1999. Reisig, 1985 Rowstron, 1998, WCL: a co-ordination language for geographically distributed agents, World Wide Web, 1, 167, 10.1023/A:1019263731139 Wyckoff, 1998, T spaces, IBM Syst. J., 37, 10.1147/sj.373.0454 G. Zavattaro, On the incomparability of Gamma and Linda, Technical Report SEN-R9827, Centrum voor Wiskunde en Informatica-CWI, 1998. Zavattaro, 1998, Towards a hierarchy of negative test operators for generative communication, vol. 16(2)