Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/19145
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | AMELOOT, Tom | - |
dc.date.accessioned | 2015-09-15T08:27:45Z | - |
dc.date.available | 2015-09-15T08:27:45Z | - |
dc.date.issued | 2015 | - |
dc.identifier.citation | ACM TRANSACTIONS ON DATABASE SYSTEMS, 40 (2) | - |
dc.identifier.issn | 0362-5915 | - |
dc.identifier.uri | http://hdl.handle.net/1942/19145 | - |
dc.description.abstract | A distributed database system often operates in an asynchronous communication model where messages can be arbitrarily delayed. This communication model causes nondeterministic effects like unpredictable arrival orders of messages. Nonetheless, in general we want the distributed system to be deterministic; the system should produce the same output despite the nondeterministic effects on messages. Previously, two interpretations of determinism have been proposed. The first says that all infinite fair computation traces produce the same output. The second interpretation is a confluence notion, saying that all finite computation traces can still be extended to produce the same output. A decidability result for the confluence notion was previously obtained for so-called simple transducer networks, a model from the field of declarative networking. In the current article, we also present a decidability result for simple transducer networks, but this time for the first interpretation of determinism, with infinite fair computation traces. We also compare the expressivity of simple transducer networks under both interpretations. | - |
dc.language.iso | en | - |
dc.publisher | ASSOC COMPUTING MACHINERY | - |
dc.rights | Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from permissions@acm.org. © 2015 ACM | - |
dc.subject.other | Languages; Theory; Determinism; decidability; expressive power; relational transducer; cloud programming; declarative networking | - |
dc.title | Deciding Determinism with Fairness for Simple Transducer Networks | - |
dc.type | Journal Contribution | - |
dc.identifier.issue | 2 | - |
dc.identifier.volume | 40 | - |
local.format.pages | 39 | - |
local.format.pages | 37 | - |
local.bibliographicCitation.jcat | A1 | - |
dc.description.notes | [Ameloot, Tom J.] Hasselt Univ, Hasselt, Belgium. [Ameloot, Tom J.] Transnat Univ Limburg, Limburg, Belgium. | - |
local.publisher.place | NEW YORK | - |
local.type.refereed | Refereed | - |
local.type.specified | Article | - |
dc.identifier.doi | 10.1145/2757215 | - |
dc.identifier.isi | 000357269900003 | - |
item.contributor | AMELOOT, Tom | - |
item.validation | ecoom 2016 | - |
item.fulltext | With Fulltext | - |
item.accessRights | Restricted Access | - |
item.fullcitation | AMELOOT, Tom (2015) Deciding Determinism with Fairness for Simple Transducer Networks. In: ACM TRANSACTIONS ON DATABASE SYSTEMS, 40 (2). | - |
crisitem.journal.issn | 0362-5915 | - |
crisitem.journal.eissn | 1557-4644 | - |
Appears in Collections: | Research publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
a9-ameloot.pdf Restricted Access | 293.36 kB | Adobe PDF | View/Open Request a copy |
Page view(s)
62
checked on Apr 26, 2023
Download(s)
50
checked on Apr 26, 2023
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.