On the Expressiveness of Timed Coordination via Shared Dataspaces

Authors:
Isabelle Linden;Jean-Marie Jacquet
Affiliations:
Institute of Informatics, University of Namur, Namur, Belgium;Institute of Informatics, University of Namur, Namur, Belgium
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2007

Citing 18
Cited 0

Statecharts: A visual formalism for complex systems

Science of Computer Programming
LUSTRE: a declarative language for real-time programming

POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Coordination languages and their significance

Communications of the ACM
The ESTEREL synchronous programming language: design, semantics, implementation

Science of Computer Programming
Concurrent constraint programming

Concurrent constraint programming
Programming by multiset transformation

Communications of the ACM
Embedding as a tool for language comparison

Information and Computation
Timed default concurrent constraint programming

Journal of Symbolic Computation - Special issue: executable temporal logics
A timed concurrent constraint language

Information and Computation
JavaSpaces Principles, Patterns, and Practice

JavaSpaces Principles, Patterns, and Practice
On the expressive power of temporal concurrent constraint programming languages

Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming
On the expressiveness of coordination via shared dataspaces

Science of Computer Programming - Special issue on coordination languages and architectures
Embeddings Among Concurrent Programming Languages (Preliminary Version)

CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Operational and Compositional Semantics of Synchronous Automaton Compositions

CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Bauhaus Linda

ECOOP '94 Selected papers from the ECOOP'94 Workshop on Models and Languages for Coordination of Parallelism and Distribution, Object-Based Models and Languages for Concurrent Systems
Expired data collection in shared dataspaces

Theoretical Computer Science - Foundations of software science and computation structures
T spaces

IBM Systems Journal
Towards resource handling in logic programming: The PPL framework and fits semantics

Computer Languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

Since Linda, many differents coordination models using shared dataspaces have been developped. However, a few only have incorporated the notion of time. This paper builds upon previous work to study the expressive power of two families of timed coordination models based on shared dataspaces. The first one relies on Linda's communication primitives whereas the second relies on the more general notion of multi-set rewriting, incorporated, for instance, in Gamma. We analyse the expressiveness increase provided by the primitives in each of the two families and also compare the expressiveness power of the two families.