Abstract
In [5] we introduced a Timed Linda language (T-Linda) whic hwas obtained by a natural timed interpretation of the usual constructs of the Linda model and by including a simple primitive for specifying time-outs. Here we define a denotational model for T-Linda which is based on timed reactive sequences. The correctness of this model is proved w.r.t a notion of observ ables which include finite traces of actions and input/output pairs.
Original language | English |
---|---|
Title of host publication | PPDP '01 Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming |
Pages | 28 - 36 |
DOIs | |
Publication status | Published - 5 Sept 2001 |
Bibliographical note
PPDP '01 Principles and Practice of Declarative ProgrammingFlorence, Italy — September 05 - 07, 2001