Timed Asynchronous System Models for Dependable Mobile Systems

We describe two system models that allow the implementation of dependable applications in asynchronous systems. We provide assumptions that are sufficiently weak to be satisfied by real distributed systems. Nevertheless, we can show that important problems of dependable computing are still solvable. For mobile systems we weaken the assumptions even more and show that it is still possible to solve the consensus problem using eventually perfect failure detectors using communication via stubborn channels.