A Timed Linda Language

Authors:
Frank S. de Boer;Maurizio Gabbrielli;Maria Chiara Meo
Affiliations:
-;-;-
Venue:
COORDINATION '00 Proceedings of the 4th International Conference on Coordination Languages and Models
Year:
2000

Citing 12
Cited 2

Generative communication in Linda

ACM Transactions on Programming Languages and Systems (TOPLAS)
The semantic foundations of concurrent constraint programming

POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Transition system specifications with negative premises

Theoretical Computer Science
A process algebra for timed systems

Information and Computation
Timed default concurrent constraint programming

Journal of Symbolic Computation - Special issue: executable temporal logics
A process algebra of communicating shared resources with dense time and priorities

Theoretical Computer Science
A process algebraic view of Linda coordination primitives

Theoretical Computer Science - Special issue: theoretical aspects of coordination languages
Linda-based applicative and imperative process algebras

Theoretical Computer Science
A timed concurrent constraint language

Information and Computation
Process Calculi for Coordination: From Linda to JavaSpaces

AMAST '00 Proceedings of the 8th International Conference on Algebraic Methodology and Software Technology
Interactive Mobile Agents in X-Klaim

WETICE '98 Proceedings of the 7th Workshop on Enabling Technologies: Infrastructure for Collaborative Enterprises
T spaces

IBM Systems Journal

Termination and divergence are undecidable under a maximum progress multi-step semantics for linca

ICTAC'06 Proceedings of the Third international conference on Theoretical Aspects of Computing
A Timed Linda Language and its Denotational Semantics

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce a Timed Linda language (T-Linda) which is obtained by a natural timed interpretation of the usual constructs of the Linda model and by adding a simple primitive which allows one to specify time-outs. Parallel execution of processes follows the scheduling policy of interleaving, however maximal parallelism is assumed for actions depending on time. We define the operational semantics of T-Linda by means of a transition system (a denotational model is defined in 4).