Abstract
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 non-terminating 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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ahern, A., Yoshida, N.: Formalising Java RMI with Explicit Code Mobility. In: Proc. OOPSLA 2005, ACM Press, New York (2005) A full version will appear in TCS
Andova, S., Baeten, J.C.M., Willemse, T.A.C.: A complete axiomatisation of branching bisimulation for probabilistic systems with an application in protocol verification. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol. 4137, pp. 327–342. Springer, Heidelberg (2006)
Berger, M.: Towards Abstractions for Distributed Systems. PhD thesis, Imperial College, London (2002)
Berger, M.: Basic Theory of Reduction Congruence for Two Timed Asynchronous π-Calculi. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170, pp. 115–130. Springer, Heidelberg (2004)
Berger, M., Honda, K., Yoshida, N.: Sequentiality and the π-calculus. In: Abramsky, S. (ed.) TLCA 2001. LNCS, vol. 2044, pp. 29–45. Springer, Heidelberg (2001)
Berger, M., Honda, K., Yoshida, N.: Genericity and the π-calculus. Acta Inf. 42(2-3), 83–141 (2005)
Berger, M., Yoshida, N.: Timed, distributed, probabilistic, typed processes. Long version of the present paper, draft (2007)
Carbone, M., Honda, K., Yoshida, N.: Structured Communication-Centred Programming for Web Services. In: ESOP 2007. LNCS, vol. 4421, Springer, Heidelberg (2007)
Chatzikokolakis, K., Palamidessi, C.: A Framework to Analyze Probabilistic Protocols and its Application to the Partial Secrets Exchange. TCS (to appear)
Chen, J.: A timed mobile calculus. In: Proc. Nordic Workshop on Programming Theory, pp. 65–67 (2004)
Deng, Y., Du, W.: Probabilistic Barbed Congruence. In: Proc. QAPL (to appear, 2007)
Deng, Y., Palamidessi, C.: Axiomatizations for probabilistic finite-state behaviors. TCS 373(1-2), 92–114 (2007)
Desharnais, J., Gupta, V., Jagadeesan, R., Panangaden, P.: Metrics for Labelled Markov Processes. TCS 318(3), 354–413 (2004)
Desharnais, J., Jagadeesan, R., Gupta, V., Panangaden, P.: The metric analogue of weak bisimulation for probabilistic processes. In: Proc. LICS, pp. 413–422 (2002)
Giacalone, A., Jou, C.-C., Smolka, S.A.: Algebraic reasoning for probabilistic concurrent systems. In: Proc. Conf. on Programming Concepts and Methods, pp. 443–458 (1990)
Gray, C.G., Cheriton, D.R.: Leases: an efficient fault-tolerant mechanism for distributed file cache consistency. Technical Report CS-TR-90-1298, Stanford University (1990)
Herescu, O.M., Palamidessi, C.: Probabilistic asynchronous π-calculus. In: Tiuryn, J. (ed.) ETAPS 2000 and FOSSACS 2000. LNCS, vol. 1784, pp. 146–160. Springer, Heidelberg (2000)
Honda, K.: Composing Processes. In: POPL 1996, pp. 344–357. ACM Press, New York (1996)
Honda, K., Yoshida, N.: A uniform type structure for secure information flow. In: POPL 2002, pp. 81–92. ACM Press, New York (2002) Full version to appear in ACM TOPLAS
Igarashi, A., Kobayashi, N.: A generic type system for the pi-calculus. Theoretical Computer Science 311(1-3), 121–163 (2004)
Kobayashi, N.: Type-based information flow analysis for the pi-calculus. Acta Inf. 42(4-5), 291–347 (2005)
Kobayashi, N.: A new type system for deadlock-free processes. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol. 4137, pp. 233–247. Springer, Heidelberg (2006)
Kobayashi, N., Pierce, B.C., Turner, D.N.: Linearity and the Pi-Calculus. ACM TOPLAS 21(5), 914–947 (1999)
Kocher, P.C.: Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems. In: McCurley, K.S., Ziegler, C.D. (eds.) Advances in Cryptology 1981 - 1997. LNCS, vol. 1440, pp. 104–113. Springer, Heidelberg (1999)
Mills, D.L.: The network computer as precision timekeeper. In: PTTI, pp. 96–108 (1996)
Mullender, S. (ed.): Distributed Systems. Addison-Wesley, Reading (1993)
Rounds, W.C., Song, H.: The Phi-Calculus: A Language for Distributed Control of Reconfigurable Embedded Systems. In: Proc. HSCC, pp. 435–449 (2003)
Segala, R.: Probability and Nondeterminism in Operational Models of Concurrency. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol. 4137, pp. 64–78. Springer, Heidelberg (2006)
van Breugel, F., Worrell, J.: A Behavioural Pseudometric for Probabilistic Transition Systems. TCS 331(1), 115–142 (2005)
Varacca, D., Yoshida, N.: Probabilistic π-Calculus and Event Structures. In: Proc. QAPL, ENTCS (to appear, 2007)
Ying, M.: π-calculus with noisy channels. Acta Informatica 41(9), 525–593 (2005)
Yoshida, N., Berger, M., Honda, K.: Strong Normalisation in the π-Calculus. Inf. & Comp. 191(2004), 145–202 (2004)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Berger, M., Yoshida, N. (2007). Timed, Distributed, Probabilistic, Typed Processes. In: Shao, Z. (eds) Programming Languages and Systems. APLAS 2007. Lecture Notes in Computer Science, vol 4807. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76637-7_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-76637-7_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-76636-0
Online ISBN: 978-3-540-76637-7
eBook Packages: Computer ScienceComputer Science (R0)