Generative communication in Linda
ACM Transactions on Programming Languages and Systems (TOPLAS)
The mathematics of Petri nets
Coordination languages and their significance
Communications of the ACM
Programming by multiset transformation
Communications of the ACM
Reactive, generative, and stratified models of probabilistic processes
Information and Computation
Modeling and verification of randomized distributed real-time systems
Modeling and verification of randomized distributed real-time systems
Comparing the expressive power of the synchronous and the asynchronous &pgr;-calculus
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
KLAIM: A Kernel Language for Agents Interaction and Mobility
IEEE Transactions on Software Engineering
Solving the Linda multiple rd problem using the copy-collect primitive
Science of Computer Programming
Computability of Recursive Functions
Journal of the ACM (JACM)
On the expressiveness of Linda coordination primitives
Information and Computation - Special issue on EXPRESS 1997
JavaSpaces Principles, Patterns, and Practice
JavaSpaces Principles, Patterns, and Practice
State- and Event-Based Reactive Programming in Shared Dataspaces
COORDINATION '02 Proceedings of the 5th International Conference on Coordination Models and Languages
Reactive Tuple Spaces for Mobile Agent Coordination
MA '98 Proceedings of the Second International Workshop on Mobile Agents
Distributed Computing: Fundamentals, Simulations and Advanced Topics
Distributed Computing: Fundamentals, Simulations and Advanced Topics
Computation: finite and infinite machines
Computation: finite and infinite machines
Secure shared data-space coordination languages: a process algebraic surveys
Science of Computer Programming - Special issue on security issues in coordination models, languages, and systems
Expressing Priorities and External Probabilities in Process Algebra via Mixed Open/Closed Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
A framework for modelling and implementing self-organising coordination
Proceedings of the 2009 ACM symposium on Applied Computing
Combining Timed Coordination Primitives and Probabilistic Tuple Spaces
Trustworthy Global Computing
Biochemical Tuple Spaces for Self-organising Coordination
COORDINATION '09 Proceedings of the 11th International Conference on Coordination Models and Languages
Algebraic foundation of a data model for an extensible space-based collaboration protocol
IDEAS '09 Proceedings of the 2009 International Database Engineering & Applications Symposium
A Space-Based Generic Pattern for Self-Initiative Load Balancing Agents
ESAW '09 Proceedings of the 10th International Workshop on Engineering Societies in the Agents World X
An expressiveness study of priority in process calculi
Mathematical Structures in Computer Science
Chemical-inspired self-composition of competing services
Proceedings of the 2010 ACM Symposium on Applied Computing
Probabilistic linda-based coordination languages
FMCO'04 Proceedings of the Third international conference on Formal Methods for Components and Objects
On the expressive power of global and local priority in process calculi
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
| Hi-index | 0.00 |
Tuple Spaces is a well-known coordination model at the basis of coordination languages such as Linda, JavaSpaces and TSpaces. Tuple spaces are flat and unstructured multisets of tuples that can be accessed via output, read, and input operations. We investigate, from an expressiveness viewpoint, the impact of the introduction of quantitative information in the tuple space coordination model in order to quantify the relevance or importance of each tuple. We consider two possible interpretations for this information: in the first case it quantifies a weight indicating how much frequently each tuple should be retrieved, in the second case it expresses a priority level for the tuples.