On the expressiveness of Linda coordination primitives

Information and Computation

Volumn 156, Issue 1-2, 2000, Pages 90-121

  Busi, Nadia ^a   Gorrieri, Roberto ^a   Zavattaro, Gianluigi ^a  

^a UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTER SIMULATION; THEOREM PROVING;

GENERATIVE COMMUNICATION;

SEMANTICS;

EID: 0034627957     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1999.2823     Document Type: Article

References (32)

1. Amadio, R., Castellani, I., and Sangiorgi, D. (1998), On bisimulations for the asynchronous π-calculus, Theoret. Comput. Sci. 195(2), 291-324.
2. Boudol, G. (1992), "Asynchrony and the π-Calculus," Technical Report 1702, INRIA, Sophia-Antipolis.
3. Brogi, A., and Ciancarini, P. (1991), The concurrent language Shared Prolog, ACM Trans. Programming Lang. Systems 13(1), 99-123.
4. Busi, N. (1998), "Petri Nets with Inhibitor and Read Arcs: Semantics, Analysis and Application to Process Calculi," Ph.D. thesis, Department of Mathematics, University of Siena, Italy.
5. Busi, N., and Gorrieri, R. (1995), A Petri net semantics for π-calculus, in "Concur'95," LNCS, Vol. 962, 145-159.
6. Busi, N., Gorrieri, R., and Zavattaro, G. (1997), "A Truly Concurrent view of Linda Interprocess Communication," Technical Report UBLCS 97-2, Department of Computer Science, University of Bologna.
7. Busi, N., Gorrieri, R., and Zavattaro, G. (1997), Three semantics of the output operation for generative communication, in "Coordination '97," LNCS, Vol. 1282, pp. 205-219.
8. Busi, N., Gorrieri, R., and Zavattaro, G. (1998), A process algebraic view of Linda coordination primitives, Theoret. Comput. Sci. 192(2), 167-199.
9. Busi, N., Gorrieri, R., and Zavattaro, G. (1997), On the Turing equivalence of Linda coordination primitives, in "Express'97," Electronic Notes in Theoretical Computer Science, Vol. 7, Elsevier, Amsterdam.
10. Busi, N., and Pinna, G. M. (1995), A causal semantics for contextual P/T nets, in "Proc. ICTCS'95," pp. 311-325, World Scientific, Singapore.
11. Carriero, N. (1987), "Implementation of Tuple Space Machines," Research Report YALEU/DCS/RR-567, Yale Univ.
12. Carriero, N., and Gelernter, D. (1989), How to write parallel programs: A guide to the perplexed, ACM Comput. Surveys 21(3), 323-357.
13. Carriero, N., and Gelernter, D. (1990), "How to Write Parallel Programs: A first Course," MIT Press, Cambridge, MA.
14. Carriero, N., Gelernter, D., and Zuck, L. (1995), Bauhaus Linda, in "Onject-Based Models and Languages for Concurrent Systems," LNCS, Vol. 924, pp. 66-76, Springer-Verlag, New York/Berlin.
15. Cheng, A., Esparza, J., and Palsberg, J. (1995), Complexity results for 1-safe nets, Theoret. Comput. Sci. 147, 117-136.
16. Ciancarini, P., Jensen, K. K., and Yankelevich, D. (1994), On the operational semantics of a coordination language, in "Object-Based Models and Languages for Concurrent Systems," LNCS, Vol. 924, pp. 77-106, Springer-Verlag, New York/Berlin.
17. Douglas, A., Wood, A., and Rowstron, A. (1995), Linda implementation revisited, in "Transputer and Occam Developments," pp. 125-138, IOS Press, Burke, VA.
18. Gelernter, D. (1985), Generative communication in Linda, ACM Trans. Programming Lang. Systems 7(1), 80-112.
19. Gelernter, D., and Carriero, N. (1992), Coordination languages and their significance, Comm. ACM 35(2), 97-107.
20. Goltz, U. (1990), "CCS and Petri Nets," LNCS, Vol. 469, pp. 334-357, Springer-Verlag, Berlin.
21. Groote, J. F. (1993), Transition system specifications with negative premises, Theoret. Comput. Sci. 118, 263-299.
22. Honda, K., and Tokoro, M. (1991), An object calculus for asynchronous communication, in "ECOOP '91," LNCS, Vol. 512, pp. 133-147, Springer-Verlag, Berlin.
23. Jagannathan, S. (1990), "Semantics and Analysis of First-Class Tuple Spaces," Technical Report YALEU/DCS/TR-783, Department of Computer Science, Yale University.
24. Milner, R. (1989), "Communication and Concurrency," Prentice-Hall, Englewood Cliffs, NJ.
25. Milner, R. (1991), "The Polyadic π-Calculus: A Tutorial Technical Report," Department of Computer Science, University of Edinburgh, ECS-LFCS-91-180.
26. Milner, R., and Sangiorgi, D. (1992), Barbed bisimulation, in "ICALP'92," Vol. 623, pp. 685-695, Springer-Verlag, Berlin.
27. Minsky, M. L. (1967), "Computation: Finite and Infinite Machines," Prentice-Hall, Englewood Cliffs, NJ.
28. Montanari, U., and Rossi, F. (1995), Contextual nets, Acta Inform. 32(6), 545-596.
29. Narem, J. E. (1989), "An Informal Operational Semantics of C-Linda V2.3.5," Technical Report, Department of Computer Science, Yale University, YALEU/DCS/TR-839.
30. Reutenauer, C. (1988), "The Mathematics of Petri Nets," Masson, Paris.
31. Scientific Computing Associates (1995), "Linda: User's Guide and Reference Manual," Scientific Computing Associates, New Haven, CT.
32. Shepherdson, J. C., and Sturgis, J. E. (1963), Computability of recursive functions, J. Assoc. Comput. Mach. 10, 217-255.