Ensuring the correctness of a distributed system is an important challenge. Previously, two interpretations of correctness have been proposed: the rst interpretation is about determinism, saying that all innite fair computation traces produce the same output; and, the second interpretation is a conuence notion, saying that all nite computation traces can still be extended to produce the same output. A decidability result for the conuence notion was previously obtained for so-called simple transducer networks, a model from the eld of declarative networking. In the current paper, we also present a decidability result for simple transducer networks, but this time for the rst interpretation of correctness, with innite fair computation traces. We also compare the expressivity of simple transducer networks under both interpretations.
['Tom J. Ameloot']
Deciding Correctness with Fairness for Simple Transducer Networks