This paper studies the inherent trade-off between termination probability and total step complexity of randomized consensus algorithms. It shows that for every integer k, the prob...
We introduce different mobile network applications and show to which degree the concept of database transactions is required within the applications. We show properties of transact...
We present a process calculus, CCA, for the modelling and verification of mobile systems that are context-aware. This process calculus is built upon the calculus of mobile ambien...
Recently, various process calculi have been introduced which are suited for the modelling of mobile computation and in particular the mobility of program code; a prominent example ...
ct The Wireless World Research Forum (WWRF) has identified ambient-awareness and device diversity as two key properties of applications and services in future mobile systems [1]. ...