Bibliographic Details
| Title: |
A Timed Linda Language and its Denotational Semantics. |
| Authors: |
De Boer, Frank S.1 F.S.de.Boer@cwi.nl, Gabbrielli, Maurizio2 gabbri@cs.unibo.it, Meo, Maria C.3 cmeo@unich.it |
| Source: |
Fundamenta Informaticae. Dec2004, Vol. 63 Issue 4, p309-330. 22p. |
| Subjects: |
Information science, LINDA (Computer system), Optical pattern recognition, Semantics, Computer systems |
| 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 first define the operational semantics of T-Linda by means of a transition system, then we define a denotational model which is based on timed reactive sequences. The correctness of this model is proved w.r.t. a notion of observables which includes finite traces of actions and input/output pairs. [ABSTRACT FROM AUTHOR] |
|
Copyright of Fundamenta Informaticae is the property of Polskie Towarzystwo Matematyczne and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |