We study here the effect of concurrent greedy moves of players in atomic congestion games where n selfish agents (players) wish to select a resource each (out of m resources) so ...
Dimitris Fotakis, Alexis C. Kaporis, Paul G. Spira...
Local reasoning about programs exploits the natural local behaviour common in programs by focussing on the footprint - that part of the resource accessed by the program. We address...
We present a version of the CCP paradigm, which is both distributed and probabilistic. We consider networks with a fixed number of nodes, each of them possessing a local and indep...
Abstract. This paper represents the beginning of a study aimed at devising semantic models for true concurrency that provide clear distinctions between concurrency, parallelism and...
Abstract-- The use of atomic commit protocols in mobile adhoc networks involves difficulties in setting up reasonable timeouts for aborting a pending distributed transaction. This ...
George Samaras, Martin Hett, Panos K. Chrysanthis,...