Ant colonies, and more generally social insect societies, are distributed systems that, in spite of the simplicity of their individuals, present a highly structured social organization. As a result of this organization, ant colonies can accomplish complex tasks that in some cases far exceed the individual capacities of a single ant. The study of ant colonies behavior and of their self-organizin...

Builders of object-oriented distributed applications have to cope with many complex problems. One of these problems is the control of object interactions when the interacting entities are on different sites on a network. Such interactions are subject to performance drops or network failures. Managing the application behavior in these situations is difficult to achieve: a simple timeout scheme i...

In a variety of modern man-made systems, it is desirable to synthesize a cooperative behavior in groups of individual dynamical agents by distributed control laws. Examples include multi-vehicle coordination and formation flight problems, robot cooperation in production lines, as well as power balancing in micro-grids, and many more. As a consequence, distributed and cooperative control has bec...

The promises of object-orientation and distributed computing could be delivered if the software we needed were written in stone. But it isn't, it changes. The challenge of distributed object-oriented maintenance is to find a means of evolving software, which already has a distributed client base. Working within this scenario, we observe how certain object-oriented language systems seek to suppo...

The locality of a graph problem is the smallest distance T such that each node can choose its own part solution based on radius-T neighborhood. In many settings, be solved efficiently with distributed or parallel algorithm if and only it has small locality. this work we seek to automate study solvability locality: given description Π, would like determine Π solvable what asymptotic as function ...