Abstract
We propose a probabilistic interpretation of a class of reversible communicating processes. The rate of forward and backward computing steps, instead of being given explicitly, is derived from a set of formal energy parameters. This is similar to the Metropolis-Hastings algorithm. We find a lower bound on energy costs which guarantees that a process converges to a probabilistic equilibrium state (a grand canonical ensemble in statistical physics terms [19]). This implies that such processes hit a success state in finite average time, if there is one.
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
Danos, V., Krivine, J.: Reversible communicating systems. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170, pp. 292–307. Springer, Heidelberg (2004)
Danos, V., Krivine, J.: Transactions in RCCS. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol. 3653, pp. 398–412. Springer, Heidelberg (2005)
Danos, V., Krivine, J., Tarissan, F.: Self-assembling trees. Electr. Notes Theor. Comput. Sci. 175(1), 19–32 (2007)
Danos, V., Oury, N.: Equilibrium and termination. In: Cooper, S.B., Panangaden, P., Kashefi, E. (eds.) Proceedings Sixth Workshop on Developments in Computational Models: Causality, Computation, and Physics. EPTCS, vol. 26, pp. 75–84 (2010)
Danos, V., Oury, N.: Equilibrium and termination II: the case of Petri Nets. Mathematical Structures in Computer Science (to appear, 2011)
Demangeon, R., Hirschkoff, D., Kobayashi, N., Sangiorgi, D.: On the complexity of termination inference for processes. In: Barthe, G., Fournet, C. (eds.) TGC 2007. LNCS, vol. 4912, pp. 140–155. Springer, Heidelberg (2008)
Diaconis, P.: The Markov chain Monte-Carlo revolution. AMS 46(2), 179–205 (2009)
Krivine, J.: Algébres de Processus Réversible - Programmation Concurrente Déclarative. Ph.D. thesis, Université Paris 6 & INRIA Rocquencourt (November 2006)
Krivine, J.: A verification algorithm for declarative concurrent programming. CoRR abs/cs/0606095 (2006)
Kwiatkowski, M., Stark, I.: The continuous π-calculus: A process algebra for biochemical modelling. In: Heiner, M., Uhrmacher, A.M. (eds.) CMSB 2008. LNCS (LNBI), vol. 5307, pp. 103–122. Springer, Heidelberg (2008)
Lanese, I., Mezzina, C.A., Stefani, J.-B.: Reversing higher-order pi. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol. 6269, pp. 478–493. Springer, Heidelberg (2010)
Lévy, J.J.: Réductions correctes et optimales dans le λ-calcul. Ph.D. thesis, Thèse de doctorat d’État, Université Paris 7 (1978)
Metropolis, N., Rosenbluth, A., Rosenbluth, M., Teller, A., Teller, E., et al.: Equation of state calculations by fast computing machines. The Journal of Chemical Physics 21(6), 1087 (1953)
Milner, R.: Communication and concurrency. International Series on Computer Science. Prentice Hall, Englewood Cliffs (1989)
Norris, J.: Markov chains. Cambridge University Press, Cambridge (1998)
Ollivier, J., Shahrezaei, V., Swain, P.: Scalable rule-based modelling of allosteric proteins and biochemical networks. PLoS Computational Biology 6(11) (2010)
Prasad, K.V.S.: Combinators and bisimulation proofs for restartable systems. Ph.D. thesis, University of Edinburgh (1987)
Schmidt, M.: Generalized j-factorial functions, polynomials, and applications. Journal of Integer Sequences 13(2), 3 (2010)
Streater, R.: Statistical dynamics. Imperial College Press, London (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bacci, G., Danos, V., Kammar, O. (2011). On the Statistical Thermodynamics of Reversible Communicating Processes. In: Corradini, A., Klin, B., Cîrstea, C. (eds) Algebra and Coalgebra in Computer Science. CALCO 2011. Lecture Notes in Computer Science, vol 6859. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22944-2_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-22944-2_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22943-5
Online ISBN: 978-3-642-22944-2
eBook Packages: Computer ScienceComputer Science (R0)