Sciweavers

2612 search results - page 91 / 523
» Mobile Processes and Termination
Sort
View
SIAMCOMP
2010
97views more  SIAMCOMP 2010»
13 years 3 months ago
Lower Bounds for Randomized Consensus under a Weak Adversary
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...
Hagit Attiya, Keren Censor-Hillel
DAGSTUHL
2006
13 years 10 months ago
06431 Working Group Summary: Atomicity in Mobile Networks
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...
Sebastian Obermeier, Joos-Hendrik Böse, Stefa...
AINA
2009
IEEE
14 years 3 months ago
CCA: A Calculus of Context-Aware Ambients
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...
François Siewe, Antonio Cau, Hussein Zedan
CALCO
2005
Springer
114views Mathematics» more  CALCO 2005»
14 years 2 months ago
Towards a Coalgebraic Semantics of the Ambient Calculus
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 ...
Daniel Hausmann, Till Mossakowski, Lutz Schrö...
PARA
2004
Springer
14 years 2 months ago
Supporting Location-Aware Distributed Applications on Mobile Devices
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]. ...
Cristiano di Flora, Massimo Ficco, Stefano Russo