Timed, Distributed, Probabilistic, Typed Processes

This paper studies types and probabilistic bisimulations for a timed -calculus as an effective tool for a compositional analysis of probabilistic distributed behaviour. The types clarify the role of timers as interface between nonterminating and terminating communication for guaranteeing distributed liveness. We add message-loss probabilities to the calculus, and introduce a notion of approximate bisimulation that discards transitions below a certain specified probability threshold. We prove this bisimulation to be a congruence, and use it for deriving quantitative bounds for practical protocols in distributed systems, including timer-driven message-loss recovery and the Two-Phase Commit protocol.

• Type: Conference
• Year: 2007
• Where: APLAS
• Authors: Martin Berger, Nobuko Yoshida
• Keywords: APLAS 2007, Certain Specified Probability, Paper Studies Types, Probabilistic Distributed Behaviour, Programming Languages