On the expressiveness of event notification in data-driven coordination languages

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

Volumn 1782, Issue , 2000, Pages 41-55

  Busi, Nadia ^a   Zavattaro, Gianluigi ^a  

^a UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

COORDINATION LANGUAGE; COORDINATION MECHANISMS; COORDINATION MIDDLEWARE; EVENT NOTIFICATION; INPUT AND OUTPUTS; JAVA PROGRAMMING; LINDA COORDINATION MODEL; SHARED REPOSITORIES;

COMPUTER PROGRAMMING;

EID: 84947291790     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46425-5_3     Document Type: Conference Paper

References (20)

1. F. Arbab, I. Herman, and P. Spilling. An overview of Manifold and its implementation. Concurrency: Practice and Experience, 5(1):23-70, 1993.
2. N. Busi, R. Gorrieri, and G. Zavattaro. A Process Algebraic View of Linda Coordination Primitives. Theoretical Computer Science, 192(2):167-199, 1998.
3. N. Busi, R. Gorrieri, and G. Zavattaro. Comparing Three Semantics for Lindalike Languages. Theoretical Computer Science, to appear. An extended abstract appeared in Proc. of Coordination'97.
4. N. Busi, R. Gorrieri, and G. Zavattaro. On the Expressiveness of Linda Coordination Primitives. Information and Computation, to appear. An extended abstract appeared in Proc. of Express'97.
5. N. Busi and G. Zavattaro. Event Notification in Data-driven Coordination Languages: Comparing the Ordered and Unordered Interpretation. In Proc. of SAC2000, ACM press. To appear.
6. A. Cheng, J. Esparza, and J. Palsberg. Complexity results for 1-safe nets. Theoretical Computer Science, 147:117-136, 1995.
7. C. Dufourd, A. Finkel, and P. Schnoebelen. Reset nets between decidability and undecidability. In Proc. of ICALP'98, volume 1061 of Lecture Notes in Computer Science, pages 103-115. Springer-Verlag, Berlin, 1998.
8. D. Gelernter. Generative Communication in Linda. ACM Transactions on Programming Languages and Systems, 7(1):80-112, 1985.
9. J.F. Groote. Transition system specifications with negative premises. Theoretical Computer Science, 118:263-299, 1993.
10. J. Leichter. Shared Tuple Memories, Shared Memories, Buses and LANS: Linda Implementations Across the Spectrum of Connectivity. PhD thesis, Yale University Department of Computer Science, 1989.
11. J. McClain. Personal communications. March 1999.
12. M.L. Minsky. Computation: finite and infinite machines. Prentice-Hall, 1967.
13. G.A. Papadopoulos and F. Arbab. Coordination Models and Languages. Advances in Computers, 46:329-400, 1998.
14. C. A. Petri. Kommunikation mit Automaten. PhD thesis, Institut für Instrumentelle Mathematik, Bonn, Germany, 1962.
15. G. Plotkin. A structural approach to operational semantics. Technical Report DAIMI FN-19, University of Aarhus, 1981.
16. W. Reisig. Petri Nets: An Introduction. EATCS Monographs in Computer Science. Springer-Verlag, Berlin, 1985.
17. J.C. Shepherdson and J.E. Sturgis. Computability of recursive functions. Journal of the ACM, 10:217-255, 1963.
18. Sun Microsystem, Inc. JavaSpaces Specifications, 1998.
19. Sun Microsystem, Inc. Jini Architecture Specifications, 1998.
20. P. Wyckoff, S.W. McLaughry, T.J. Lehman, and D.A. Ford. T Spaces. IBM Systems Journal, 37(3),1998