POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
ACM Transactions on Programming Languages and Systems (TOPLAS)
A uniform type structure for secure information flow
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The Metric Analogue of Weak Bisimulation for Probabilistic Processes
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Leases: an efficient fault-tolerant mechanism for distributed file cache consistency.
Leases: an efficient fault-tolerant mechanism for distributed file cache consistency.
A generic type system for the Pi-calculus
Theoretical Computer Science
Strong normalisation in the π-calculus
Information and Computation
Metrics for labelled Markov processes
Theoretical Computer Science - Logic, semantics and theory of programming
A behavioural pseudometric for probabilistic transition systems
Theoretical Computer Science - Automata, languages and programming
Formalising Java RMI with explicit code mobility
OOPSLA '05 Proceedings of the 20th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Acta Informatica
Type-based information flow analysis for the π-calculus
Acta Informatica - Special issue: Types in concurrency. Part II , Guest Editor: R. De Nicola, D. Sangiorgi
Axiomatizations for probabilistic finite-state behaviors
Theoretical Computer Science
Theoretical Computer Science
Sequentiality and the π-calculus
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
Structured communication-centred programming for web services
ESOP'07 Proceedings of the 16th European conference on Programming
The φ-calculus: a language for distributed control of reconfigurable embedded systems
HSCC'03 Proceedings of the 6th international conference on Hybrid systems: computation and control
Probability and nondeterminism in operational models of concurrency
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
A new type system for deadlock-free processes
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Value-passing CCS with noisy channels
Theoretical Computer Science
Time and exceptional behavior in multiparty structured interactions
WS-FM'11 Proceedings of the 8th international conference on Web Services and Formal Methods
| Hi-index | 0.00 |
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.