A declarative approach to distributed computing: Specification, execution and analysis

摘要

There is an increasing interest in using logic programming to specify and implement distributed algorithms, including a variety of network applications. These are applications where data and computation are distributed among several devices and where, in principle, all the devices can exchange data and share the computational results of the group. In this paper we propose a declarative approach to distributed computing whereby distributed algorithms and communication models can be (ⅰ) specified as action theories of fluents and actions; (ⅱ) executed as collections of distributed state machines, where devices are abstracted as (input/output) automata that can exchange messages; and (ⅲ) analysed using existing results on connecting causal theories and Answer Set Programming. Results on the application of our approach to different classes of network protocols are also presented.