论文信息 - Equilibrium and Termination

Equilibrium and Termination

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.

Vincent Danos | Nicolas Oury

[1] Vincent Danos,et al. Formal Molecular Biology Done in CCS-R , 2007, Electron. Notes Theor. Comput. Sci..

[2] D. Vere-Jones. Markov Chains , 1972, Nature.

[3] E. M.,et al. Statistical Mechanics , 2021, Manual for Theoretical Chemistry.

[4] James R Faeder,et al. Rule-based modeling of biochemical systems with BioNetGen. , 2009, Methods in molecular biology.

[5] Vincent Danos,et al. Modelling Epigenetic Information Maintenance: A Kappa Tutorial , 2009, CAV.

[6] Mirabelle Nebut,et al. Rule-based modeling of transcriptional attenuation at the tryptophan operon , 2009, Proceedings of the 2009 Winter Simulation Conference (WSC).

[7] S. Schuster,et al. A generalization of Wegscheider's condition. Implications for properties of steady states and for quasi-steady-state approximation , 1989 .

[8] Dag Wedelin,et al. Benchmarks for identification of ordinary differential equations from time series data , 2009, Bioinform..

[9] Cosimo Laneve,et al. Formal molecular biology , 2004, Theor. Comput. Sci..

[10] Edda Klipp,et al. Formal representation of the high osmolarity glycerol pathway in yeast. , 2010, Genome informatics. International Conference on Genome Informatics.

[11] William S. Hlavacek,et al. BioNetGen: software for rule-based modeling of signal transduction based on the interactions of molecular domains , 2004, Bioinform..

[12] Emil L. Post. A variant of a recursively unsolvable problem , 1946 .