Document Server@UHasselt >
Research >
Research publications >

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

Title: Deciding Correctness with Fairness for Simple Transducer Networks
Authors: Ameloot, Tom J.
Issue Date: 2014
Citation: Proceedings of the 17th International Conference on Database Theory
Abstract: Ensuring the correctness of a distributed system is an important challenge. Previously, two interpretations of correctness have been proposed: the first interpretation is about determinism, saying that all infinite fair computation traces produce the same output; and, 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 paper, we also present a decidability result for simple transducer networks, but this time for the first interpretation of correctness, with infinite fair computation traces. We also compare the expressivity of simple transducer networks under both interpretations.
URI: http://hdl.handle.net/1942/16416
ISBN: 978-3-89318066-1
Category: C1
Type: Proceedings Paper
Appears in Collections: Research publications

Files in This Item:

Description SizeFormat
author version428.86 kBAdobe PDF

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