State—and Event-Based Reactive Programming in Shared Dataspaces
The traditional Linda programming style, based on the introduction and consumption of data from a common repository, seems not adequate for highly dynamic applications in which it is important to observe modi.cation of the environment which occur quickly. On the other hand, reactive programming seems more appropriate for this kind of applications. In this paper we consider some approaches recently presented in the literature for embedding reactive programming in shared dataspaces, we present a possible classification for these approaches, and we perform a rigorous investigation of their relative advantages and disadvantages.
Unable to display preview. Download preview PDF.
- [BZ00]N. Busi and G. Zavattaro. On the Expressivenes of Event Notification in Data-Driven Coordination Languages. In Proc. of ESOP 2000, volume 1782 of Lecture Notes in Computer Science, pages 41–55. Springer-Verlag, Berlin, 2000.Google Scholar
- [dBP91]F.S. de Boer and C. Palamidessi. Embedding as a Tool for Language Comparison: On the CSP Hierarchy. In Proc. of CONCUR’91, volume 527, pages 127–141. Springer-Verlag, Berlin, 1991.Google Scholar
- [Mil89]R. Milner. Communication and Concurrency. Prentice-Hall, 1989.Google Scholar
- [W+98]J. Waldo et al. Javaspace speci.cation-1.0. Technical report, Sun Microsystems, March 1998.Google Scholar