Definition of TOTA propagation rules with Prolog theories

This project aims at developing some basic methods to describe tuple features, according to TOTA requirements, in a more compact and simple fashion. To accomplish this task we try to develop a special-purpose language, exploiting Prolog features, and to modify the TOTA middleware in order to support it. With this given language, one should be able to define the various aspects that rule the propagation patterns of tuples, realizing the desired behaviour. This modifications should mantain the full capabilities of the standard TOTA middleware and, if possible, enhance them.

The attached archive contains a functioning prototype of such framework, some utilization examples and a full report of the project.

TOTA is a distributed coordination middleware based on computational fields and tuple-spaces, designed by the University of Modena and Reggio-Emilia.