Distributed applications are based on algorithms which should be able to deal with time constraints. It is mandatory to express time constraints in (mathematical) models and the cu...
Replicated systems that run over partitionable environments, can exhibit increased availability if isolated partitions are allowed to optimistically continue their execution indep...
Mikael Asplund, Simin Nadjm-Tehrani, Stefan Beyer,...
Abstract—We investigate optimal resource allocation for delaylimited cooperative communication in time varying wireless networks. Motivated by real-time applications that have st...
We provide an effective procedure for deciding the existence of off-line guessing attacks on security protocols, for a bounded number of sessions. The procedure consists of a co...
In this paper, we prove that type-tagging prevents type-flaw attacks on security protocols that use the Exclusive-OR operator as our main contribution. Our proof method is general ...