In this paper, we develop model checking procedures for three ways of combining (temporal) logics: temporalization, independent combination, and join. We prove that they are termin...
Massimo Franceschet, Angelo Montanari, Maarten de ...
—Epidemic protocols assume that information of a random set of nodes is provided at each protocol round. By definition, the random set needs to be chosen uniformly and randomly ...
Jin Sun, Paul J. Weber, Byung Kyu Choi, Roger M. K...
Recently we have proposed an approach to utilizing agent teams as resource brokers and managers in the Grid. Thus far we have discussed the general overview of the proposed system,...
Wojciech Kuranowski, Marcin Paprzycki, Maria Ganzh...
This paper is devoted to the following incremental problem. Initially, a graph and a distinguished subset of vertices, called initial group, are given. This group is connected by ...
In this paper, we show that universal routing can be achieved with low overhead in distributed networks. The validity of our results rests on a new network called the fat-stack. W...