Equilibrium and Termination

  title={Equilibrium and Termination},
  author={Vincent Danos and Nicolas Oury},
We present a reduction of the termination problem for a Turing machine (in the simplified form of the Post correspondence problem) to the problem of determining whether a continuous-time Markov chain presented as a set of Kappa graph-rewriting rules has an equilibrium. It follows that the problem of whether a computable CTMC is dissipative (ie does not have an equilibrium) is undecidable. 

Figures from this paper

Equilibrium and Termination ( extended version ) ∗

We present a reduction of the Post correspondence problem (PCP) to the question of whether a continuous-time Markov chain (CTMC) presented as a set graph-rewriting rules has an equilibrium. It

Equilibrium and termination II: the case of Petri nets

A simple algebraic criterion is established for the existence of an equilibrium that satisfies the detailed balance condition familiar from the thermodynamics of reaction networks and it is found that when such a probability exists, it can be described by a free energy function that combines an internal energy term and an entropy term.

On the Statistical Thermodynamics of Reversible Communicating Processes

A lower bound on energy costs is found which guarantees that a process converges to a probabilistic equilibrium state (a grand canonical ensemble in statistical physics terms) and implies that such processes hit a success state in finite average time, if there is one.

Thermodynamic Graph-Rewriting

A new thermodynamic approach to stochastic graph-rewriting, where the generators define the qualitative dynamics, by showing which transformations are possible, while the energy patterns and cost function specify the long-term probability of any reachable graph.

Cooperative Assembly Systems

The phase transition structure of a class of bipartite cooperative assembly systems is investigated and which of these systems have a (probabilistic) equilibrium and find an explicit form for their local energy is characterized.



Formal Molecular Biology Done in CCS-R

A variant of a recursively unsolvable problem

By a string on a, 6 we mean a row of a's and 6's such as baabbbab. I t may involve only a, or 6, or be null. If, for example, gi, g2, gz represent strings baby aa, b respectively, string g2gigigzg2

A generalization of Wegscheider's condition. Implications for properties of steady states and for quasi-steady-state approximation

A generalization of Wegschcider's condition concerning equilibrium constants in chemically reacting systems is formulated, which is then proved to be a necessary and sufficient condition for detailed

Formal molecular biology

Statistical Mechanics:

AbstractPROF. R. H. FOWLER'S monumental work on statistical mechanics has, in this the second edition, in his own modest words, been rearranged and brought more up to date. But the new volume is much

Rule-based modeling of transcriptional attenuation at the tryptophan operon

This paper presents a discrete stochastic model of the fine-grained control of attenuation, based on chemical reactions, which is easier to understand than master equations and compact due to rule schemas that define finite sets of chemical reactions.

Rule-based modeling of biochemical systems with BioNetGen.

This work focuses on how a rule-based model is specified in the BioNetGen language (BNGL) and how a model specification is analyzed using the Bio netGen software tool.

Modelling Epigenetic Information Maintenance: A Kappa Tutorial

An approach to the quantitative modelling of molecular interaction networks which departs from the usual notion of (bio-) chemical reaction is explained and illustrated.

Formal representation of the high osmolarity glycerol pathway in yeast.

A detailed generic formal representation of the HOG system without simplifying assumptions is presented, showing the molecular interactions known from the literature, and is compared with a few other modelling languages and software tools that could also be used to represent and model the H OG system.

Benchmarks for identification of ordinary differential equations from time series data

This work proposes how to specify identification problems as optimization problems with a model space of allowed reactions, and defines a file format for such problems, which allows all problems to be solved without the use of supercomputing.