A Timed Linda Language and its Denotational Semantics.
Saved in:
| 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 |
| FullText | Links: – Type: pdflink Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 16217616 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: A Timed Linda Language and its Denotational Semantics. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22De+Boer%2C+Frank+S%2E%22">De Boer, Frank S.</searchLink><relatesTo>1</relatesTo><i> F.S.de.Boer@cwi.nl</i><br /><searchLink fieldCode="AR" term="%22Gabbrielli%2C+Maurizio%22">Gabbrielli, Maurizio</searchLink><relatesTo>2</relatesTo><i> gabbri@cs.unibo.it</i><br /><searchLink fieldCode="AR" term="%22Meo%2C+Maria+C%2E%22">Meo, Maria C.</searchLink><relatesTo>3</relatesTo><i> cmeo@unich.it</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Fundamenta+Informaticae%22">Fundamenta Informaticae</searchLink>. Dec2004, Vol. 63 Issue 4, p309-330. 22p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Information+science%22">Information science</searchLink><br /><searchLink fieldCode="DE" term="%22LINDA+%28Computer+system%29%22">LINDA (Computer system)</searchLink><br /><searchLink fieldCode="DE" term="%22Optical+pattern+recognition%22">Optical pattern recognition</searchLink><br /><searchLink fieldCode="DE" term="%22Semantics%22">Semantics</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+systems%22">Computer systems</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: 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] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>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.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=16217616 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.3233/fun-2004-63401 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 22 StartPage: 309 Subjects: – SubjectFull: Information science Type: general – SubjectFull: LINDA (Computer system) Type: general – SubjectFull: Optical pattern recognition Type: general – SubjectFull: Semantics Type: general – SubjectFull: Computer systems Type: general Titles: – TitleFull: A Timed Linda Language and its Denotational Semantics. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: De Boer, Frank S. – PersonEntity: Name: NameFull: Gabbrielli, Maurizio – PersonEntity: Name: NameFull: Meo, Maria C. IsPartOfRelationships: – BibEntity: Dates: – D: 15 M: 12 Text: Dec2004 Type: published Y: 2004 Identifiers: – Type: issn-print Value: 01692968 Numbering: – Type: volume Value: 63 – Type: issue Value: 4 Titles: – TitleFull: Fundamenta Informaticae Type: main |
| ResultId | 1 |
