Document Server@UHasselt >
Research >
Research publications >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/20633

Title: Deciding Confluence for a Simple Class of Relational Transducer Networks
Authors: Ameloot, Tom J.
Van den Bussche, Jan
Issue Date: 2015
Publisher: SPRINGER
Citation: THEORY OF COMPUTING SYSTEMS, 57 (4), p. 1038-1111
Abstract: Networks of relational transducers can serve as a formal model for declarative networking, focusing on distributed database querying applications. In declarative networking, a crucial property is eventual consistency, meaning that the final output does not depend on the message delays and reorderings caused by the network. Here, we formalize eventual consistency as a confluence notion, meaning that finite executions of the system can always be extended to yield the desired output. We show that confluence is decidable when the transducers satisfy some syntactic restrictions, some of which have also been considered in earlier work on automated verification of relational transducers. This simple class of transducer networks computes exactly all distributed queries expressible by unions of conjunctive queries with negation.
Notes: [Ameloot, Tom J.; Van den Bussche, Jan] Hasselt Univ, Hasselt, Belgium. [Ameloot, Tom J.; Van den Bussche, Jan] Transnat Univ Limburg, Hasselt, Belgium.
URI: http://hdl.handle.net/1942/20633
DOI: 10.1007/s00224-015-9624-6
ISI #: 000365792200008
ISSN: 1432-4350
Category: A1
Type: Journal Contribution
Validation: ecoom, 2016
Appears in Collections: Research publications

Files in This Item:

Description SizeFormat
published version940.37 kBAdobe PDF
author version960.89 kBAdobe PDF

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.