On the statistical thermodynamics of reversible communicating processes

Authors:
Giorgio Bacci;Vincent Danos;Ohad Kammar
Affiliations:
DiMI, University of Udine;LFCS, School of Informatics, University of Edinburgh;LFCS, School of Informatics, University of Edinburgh
Venue:
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
Year:
2011

Citing 7
Cited 1

Communication and Concurrency

Communication and Concurrency
Combinators and bisimulation proofs for restartable systems

Combinators and bisimulation proofs for restartable systems
Transactions in RCCS

CONCUR 2005 - Concurrency Theory
Self-assembling Trees

Electronic Notes in Theoretical Computer Science (ENTCS)
The Continuous π-Calculus: A Process Algebra for Biochemical Modelling

CMSB '08 Proceedings of the 6th International Conference on Computational Methods in Systems Biology
On the complexity of termination inference for processes

TGC'07 Proceedings of the 3rd conference on Trustworthy global computing
Reversing higher-order pi

CONCUR'10 Proceedings of the 21st international conference on Concurrency theory

Concurrent flexible reversibility

ESOP'13 Proceedings of the 22nd European conference on Programming Languages and Systems

Quantified Score

Hi-index	0.00

Visualization

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.