Input-to-state stability of chemical reaction networks with application to molecular computation

Chuanhou Gao; Denis Dochain; Renlei Jiang; Xiaoyu Zhang

REVIEW 3 major objections 4 minor 39 references

Input-to-state stability of chemical reaction networks with application to molecular computation

T0 review · 3 major / 4 minor · reviewed 2026-08-14 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read The authors prove semiglobal input-to-state stability for weakly reversible chemical reaction networks with arbitrary deficiency and multiple linkage classes, and extend the guarantee to some non-weakly reversible networks via linear…

desk verdict A useful extension of Chaves–Sontag ISS to arbitrary-deficiency weakly reversible networks and to some non-weakly-reversible ones; the main proof has an input-regularity loose end that is likely patchable. read the letter →

arxiv 2608.13302 v1 pith:CKWMOP3W submitted 2026-08-13 math.DS

Renlei Jiang , Xiaoyu Zhang , Chuanhou Gao , Denis Dochain This is my paper · ORCID

classification math.DS MSC 92C4593D0993D25

keywords chemicalreactionnetworksinput-to-statestabilitymass-actionkineticstoriclocusweakreversibilitylinearconjugacyreconstructionparallelbiomolecularcomputation

verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

Input-to-state stability (ISS) certifies that a system driven by bounded, time-varying inputs stays near its nominal trajectory, with the state deviation controlled by the input magnitude. The paper proves this property for a substantially broader class of mass-action chemical reaction networks than previously known: every weakly reversible network—one in which every reaction lies on a directed cycle—is semiglobally ISS regardless of its deficiency or number of linkage classes, provided the time-varying rate constants stay in a compact subset of the network's toric locus—the set of rate parameters for which the network is complex balanced, meaning each complex's production and consumption fluxes balance individually. It then extends the guarantee, through linear conjugacy and reconstruction, to certain networks that are not weakly reversible at all. Finally, it shows that if the input rate settles to a constant and the trajectory is permanent—uniformly bounded away from zero and infinity—then the state converges to the equilibrium belonging to that limiting input. This supplies a structural robustness certificate for parallel biomolecular computation, where coupled modules perturb one another through exactly such time-varying effective rates.

What carries the argument

The load-bearing object is the toric locus $T$ of the network, the set of rate constants at which the mass-action system is complex balanced; it supplies both the admissible input set $U\subseteq T$ and, through the smooth map $u\mapsto x^*(u)$, a moving target equilibrium. The proof combines this with the logarithmic free-energy Lyapunov function $V(x)=\sum_i (x_i(\ln x_i-\ln x_i^*-1)+x_i^*)$: over a compact $U$, the time derivative of $V$ splits into a nonpositive dissipation term coming from complex balancing and a term proportional to $|u-u^*|$. For non-weakly reversible networks, linear conjugacy and reconstruction act as coordinate changes that carry the weakly reversible ISS property back to the original network, with reconstruction eliminating conserved variables through a conserved matrix before lifting the bound back.

What would settle it

For a weakly reversible mass-action system with a compact input set $U$ inside its toric locus, construct a piecewise locally Lipschitz input $u(t)\in U$ whose derivative $\dot u(t)$ is unbounded near $t_{\max}$ and whose state escapes to infinity at $t_{\max}$; the theorem's hypotheses would be met while its forward-completeness conclusion would fail.

Watch

Extended reading notes

Core claim

The central discovery, stated as Theorem 3.7, is that weak reversibility alone—without any zero-deficiency or single-linkage-class assumption—is enough for semiglobal input-to-state stability of the time-varying mass-action system (2.7), as long as the input set $U$ is a compact subset of the toric locus $T$. For any $u^*\in U$, the system is semiglobal ISS with respect to $(x^*,u^*)$, where $x^*$ is the unique equilibrium of the frozen system at $u^*$ in the invariant stoichiometric class containing the initial state. Theorems 4.2 and 4.14 transfer this guarantee to networks that are linearly conjugate or reconstructable to weakly reversible networks, with the admissible input set described by equations (4.2) and (4.9). Theorem 5.1 then converts ISS plus permanence into convergence to the equilibrium associated with the limiting input, which is exactly what makes layer-by-layer molecular computation by parallel chemical reactions work.

Load-bearing premise

The proof of forward completeness assumes that every input has a uniformly bounded derivative on any finite time interval, whereas the theorem only states that inputs are piecewise locally Lipschitz; if that derivative bound is not available, the Gronwall argument may fail to rule out finite-time blow-up.

Editorial extensions

If this is right

Weak reversibility plus toric-locus-restricted inputs implies semiglobal ISS for arbitrary deficiency and linkage classes, generalizing the earlier zero-deficiency, single-linkage result.
Non-weakly reversible networks that admit a linearly conjugate or reconstructable weakly reversible partner inherit the ISS guarantee, and Proposition 4.8 gives explicit conditions under which every positive input profile is admissible.
When the input converges to a constant and the system is permanent, the state converges to the equilibrium of the limit system, so transient fluctuations do not leave a permanent offset.
Coupled molecular-computation modules can be composed in parallel: an upstream module's converging output acts as a time-varying rate input for a downstream module, and the downstream state follows the composite function of the limiting upstream signal.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

The toric-locus restriction on the input set suggests a testable relaxation: allow inputs to leave the complex-balanced set $T$ for short intervals and see whether an ISS-type bound can be expressed in terms of the total time spent outside $T$; the smooth-dependence machinery would still apply between excursions.
Because linear conjugacy and reconstruction are coordinate-level transformations, the same argument could certify ISS for high-dimensional conservative networks by first reducing to the free variables and then lifting the ISS bound back through the conserved matrix.
The algebraic equations defining the admissible input set $U$ in Propositions 4.6 and 4.7 could be repurposed as a computational workflow: search for a weakly reversible realization, compute $U$, and certify ISS without simulation.
In the molecular-computation application, Theorem 5.1 reduces composability to permanence; combining it with structural permanence criteria for weakly reversible systems would give fully structural, simulation-free composability conditions.

Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Desk Editor's Note

read the letter

Dear colleague,

Short version: the paper does what it says. The main new content is Theorem 3.7: any weakly reversible mass-action network with input values constrained to a compact subset of its toric locus is semiglobal ISS with respect to the associated equilibria, with no restriction on deficiency or number of linkage classes. That is a genuine generalization of Chaves–Sontag, who needed zero deficiency and one linkage class. The extensions in Section 4—via linear conjugacy and via reconstruction—are also new statements, and the molecular-computation convergence result (Theorem 5.1) is a clean application that does not just restate ISS. The paper is written in standard CRN language, the examples are helpful, and the toric-locus idea is used naturally.

The main proofs are mostly coherent. The one real soft spot is Step 2 of Theorem 3.7. The Gronwall argument needs a uniform bound on |du/dt| over [0,t_max). The declared input class is "piecewise locally Lipschitz on R_{\ge0}". If that means locally Lipschitz at every point of the half-line, then by compactness such a bound exists, including at t_max, and the stress-test concern about sin(1/(T-t)) does not land because that function is not locally Lipschitz at T. If the authors intend the weaker reading (locally Lipschitz on each side of each switch, with possible accumulation), then the bound is not guaranteed and the theorem is not proven for that class. Either way, the manuscript should state the intended regularity precisely; adding "u has an essential derivative bound on finite intervals" fixes it. This is patchable.

Also on Lemma 3.4: the reader worried that the infimum function could jump upward. I do not see that; on a compact set, the infimum of a continuous positive function as a function of the threshold is continuous by uniform continuity. That concern is not a real issue.

Example 5.2 invokes Theorem 6.4 of [15] for permanence of the conjugate time-varying system. I have not checked that theorem, but if it covers only constant rates, the time-varying permanence needs explicit justification. That is a minor gap, not a structural one.

Bottom line: the central idea is sound and the extension is worth publishing. The proof details need cleaning up, especially the input regularity in Theorem 3.7. I would send it to peer review; a good referee will catch the same issue and the authors can patch it.

Referee Report

3 major / 4 minor

Summary. The paper studies input-to-state stability (ISS) for mass-action chemical reaction networks with time-varying reaction-rate inputs. It claims two main extensions of earlier ISS results of Chaves and Sontag: first, semiglobal ISS for all weakly reversible networks with arbitrary deficiency and linkage classes, provided the input-value set is a compact subset of the toric locus; second, semiglobal ISS for certain non-weakly-reversible networks via linear conjugacy and reconstruction. The paper then proves a convergence result when the input tends to a constant and applies it to parallel molecular computation, with numerical examples illustrating the claims.

Significance. If the proofs are correct, the results form a useful generalization of the existing ISS theory for rate-controlled biochemical networks. The use of the toric locus to characterize admissible input sets is natural and avoids restrictive deficiency and linkage-class assumptions, and the extensions via linear conjugacy and reconstruction enlarge the class of networks for which robustness can be certified. The paper also gives concrete examples and simulations, and it connects ISS to a molecular-computation setting. However, the central forward-completeness proof has a gap that affects the main ISS theorems, and the same gap propagates to the non-weakly-reversible extensions, so the paper cannot be accepted in its current form.

major comments (3)

[Section 3.2, Theorem 3.7, Step 2, Eqs. (3.7)-(3.11)] The forward-completeness proof is not valid for the stated input class. The proof requires a single finite constant L in Eq. (3.7) bounding |du_j/dt| on the whole interval [0,t_max), but the input class defined in Section 2.3 is only piecewise locally Lipschitz. Such a function on a finite interval need not have a uniform Lipschitz constant; for example, u(t)=u^*+epsilon sin(1/(T-t)) lies in a compact U subset of T, is smooth on [0,T), yet has sup_{[0,T)} |du/dt|=infinity. In that case C3 in Eq. (3.10) need not be finite, and the Gronwall bound (3.11) cannot contradict lim_{t->t_max} W(t)=infinity. Since forward completeness is part of Definition 3.2(i), the semiglobal ISS claim of Theorem 3.7 is not established for all declared inputs. This is repairable by strengthening the input hypothesis (e.g., uniform Lipschitz or essentially bounded derivative on the maximal interval) or by an independent forward-completeness argument, but as written the proof is incomplete.
[Section 4, Theorems 4.2 and 4.14] The extensions to non-weakly-reversible networks inherit the forward-completeness gap and add a second one. Their proofs invoke Proposition 3.5, which explicitly assumes that the system is R^n_{>0}-forward complete, but the proofs do not verify this property for the original system or for the reconstructed system. Lemma 4.3 establishes existence, uniqueness, and smoothness of equilibria, not forward completeness; Lemmas 4.17 and 4.18 have the same scope. Therefore, even after repairing Theorem 3.7, Theorems 4.2 and 4.14 require an explicit forward-completeness argument for the transformed dynamics before Proposition 3.5 can be applied.
[Section 3.2, Lemma 3.4] The proof of Lemma 3.4 asserts that the function tilde_alpha_F(s) = inf_{|x-x*|>=s, x in F cap (x*+S) cap R^n_{>0}} [-nabla_x^T V0(x,u*) f(x;u*)] is continuous and nondecreasing on [0,s_max]. While nondecreasing is clear, continuity is not justified: an infimum over a moving compact set can jump upward when the argmin changes. The subsequent construction of a class K function alpha_F with alpha_F <= tilde_alpha_F/2 depends on this regularity, so the proof as written has a gap. A direct construction of a continuous lower bound would repair it, but that construction must be supplied.

minor comments (4)

[Definition 3.2(ii)] The phrasing 'and moreover, for all t>=0 we have x(s) in F for any s in [0,t]' is ambiguous: it reads as if the existence of beta and gamma depends on the trajectory remaining in F. The conditional form of the semiglobal ISS estimate should be stated explicitly.
[Theorem 3.7, Step 2, Eq. (3.8)] The constants C1 and C2 should be stated as uniform over u in U. This likely follows from continuity of x*(u) and compactness of U subset of R^r_{>0}, but the uniformity should be made explicit.
[Section 5, Theorem 5.1] The proof chooses a compact set F with x(t) in F for all t>=0, but permanence gives eventual bounds only. The initial transient should be absorbed into F, and this step should be stated explicitly.
[General] The title and some headers contain typographical spacing artifacts, e.g., 'INPUT-TO-ST A TE ST ABILITY' in the header; these should be corrected in revision.

Circularity Check

0 steps flagged · score 2.0 of 10

No circular derivation: the main results are derived from standard complex-balanced Lyapunov theory and external transformation theorems; the main defect found is a proof gap, not a circular reduction.

full rationale

The derivation chain is not circular. Theorem 3.7 uses the toric-locus assumption U⊆T only to invoke the standard complex-balanced Lyapunov inequality (3.6) and the uniqueness/smoothness of x*(u) from Craciun–Jin–Sorea [12]; x*(u) is not fitted to any output or to the desired conclusion. Lemma 3.4 is the standard ISS-Lyapunov perturbation argument, and Proposition 3.5 rests on the external Chaves–Sontag result. Theorems 4.2 and 4.14 obtain V0 by linear conjugacy or reconstruction from a weakly reversible complex-balanced system; the reconstruction lemmas are cited from Ke–Fang–Gao [30], which is published external work whose stated assumptions do not include the ISS target result, so the overlap with co-author Gao is not a load-bearing circular self-citation. Section 5's convergence theorem is a standard ISS-plus-permanence argument and does not define U or x* in terms of the conclusion. The only substantive defect identified is a proof gap in Step 2 of Theorem 3.7: Eq. (3.7) assumes a uniform constant L bounding |du_j/dt| on [0,t_max), while the input class in Section 2.3 is only 'piecewise locally Lipschitz'; local Lipschitz constants on a finite maximal interval need not be uniform, so the Gronwall bound (3.11) is not justified for inputs whose oscillations accumulate at t_max. This is an omitted justification and a correctness risk, not a reduction of the theorem to its own assumptions; it therefore does not raise the circularity score beyond the minor-self-citation level.

Assumptions & free parameters 0 free parameters · 6 assumptions · 0 invented entities

The paper introduces no fitted constants, no new chemical species, and no new forces. All assumptions are either standard mathematical facts or structural hypotheses from the cited CRN literature. The only questionable imported assumption is the permanence result applied to a time-varying system in Example 5.2.

assumptions (6)

domain assumption Mass-action kinetics: each reaction rate is u_j x^{v_j} with positive rate constants u_j.
The entire paper analyzes mass-action systems (2.7); results do not extend to other kinetics.
standard math Complex balanced equilibrium theory: a complex balanced MAS is weakly reversible, has a unique positive equilibrium per stoichiometric class, and the pseudo-Helmholtz function is a Lyapunov function.
Used in Section 3 to construct the ISS-Lyapunov function and in the forward-completeness proof; cited from [20,24].
domain assumption The toric locus T(N) is nonempty if and only if the network is weakly reversible, and x*(u) depends smoothly on u on T(N).
Invoked in Theorem 3.7 and Lemma 4.3 via Corollary 3.13 of [12]; smooth dependence is essential for the Gronwall argument.
domain assumption Linear conjugacy preserves equilibrium structure and Lyapunov properties as stated in [27].
Used in Theorem 4.2 and Lemmas 4.3 and 4.4 to transfer ISS from a weakly reversible network to a conjugate one.
domain assumption Reconstruction and reverse reconstruction theorems from [30] (Theorems 2 and 5, Proposition 2) ensure uniqueness of equilibria and equivalence of the reduced dynamics.
Used in Theorem 4.14 to reduce ISS of a conservative network to a lower-dimensional reverse reconstruction.
domain assumption Permanence theorem for weakly reversible networks (Theorem 6.4 of [15]) applies to time-varying rate systems with rates in a compact set.
Invoked in Example 5.2; the paper does not verify the time-varying extension.

how reviews work

0 comments

Cite this review

Pith. "Pith review of Input-to-state stability of chemical reaction networks with application to molecular computation." pith.science (2026). https://pith.science/paper/CKWMOP3W

@misc{pith2026260813302,
  author       = {Pith},
  title        = {Pith review of: Input-to-state stability of chemical reaction networks with application to molecular computation},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/CKWMOP3W}},
  note         = {Machine review of arXiv:2608.13302}
}

read the original abstract

In biological reaction systems, reaction rates may vary over time due to environmental fluctuations, regulation, or coupling with other reaction modules. Input-to-state stability (ISS) provides a useful tool for analyzing the robustness of time-varying chemical reaction networks (CRNs). Existing ISS results for CRNs typically rely on restrictive structural assumptions, such as zero deficiency, a single linkage class, or weak reversibility. This paper makes two main contributions. First, we establish ISS for a broader class of weakly reversible CRNs, allowing nonzero deficiency and multiple linkage classes. Second, we extend the analysis to certain CRNs that are not weakly reversible by using network transformation techniques (linear conjugacy and reconstruction). Together, these results enlarge the class of CRNs for which robustness under time-varying reaction-rate inputs can be certified. Since CRNs are a standard framework for biomolecular computation, our results further enable the stability analysis of parallel molecular computing systems, an important problem in biomolecular computation where multiple CRN-based computing modules operate simultaneously and perturb one another through time-varying effective reaction rates.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

39 extracted references · 35 canonical work pages

[15]

Discrete and Continuous Dynamical Systems-B , volume=

Weakly reversible deficiency one realizations of polynomial dynamical systems , author=. Discrete and Continuous Dynamical Systems-B , volume=. 2024 , publisher=

work page 2024
[1]

Bulletin of Mathematical Biology , volume=

Lyapunov functions, stationary distributions, and non-equilibrium potential for reaction networks , author=. Bulletin of Mathematical Biology , volume=. 2015 , publisher=

work page 2015
[2]

Journal of the Royal Society Interface , volume=

On reaction network implementations of neural networks , author=. Journal of the Royal Society Interface , volume=. 2021 , doi=

work page 2021
[3]

Chemical mass-action systems as analog computers:

Anderson, David F and Joshi, Badal , journal=. Chemical mass-action systems as analog computers:. 2025 , publisher=

work page 2025
[4]

SIAM Journal on Applied Mathematics , volume=

Persistence results for chemical reaction networks with time-dependent kinetics and no global conservation laws , author=. SIAM Journal on Applied Mathematics , volume=. 2011 , publisher=

2011
[5]

SIAM Journal on Mathematical Analysis , volume=

Existence of positive steady states for weakly reversible mass-action systems , author=. SIAM Journal on Mathematical Analysis , volume=. 2019 , publisher=

work page 2019
[6]

IEEE/ACM Transactions on Computational Biology and Bioinformatics , volume=

Composable rate-independent computation in continuous chemical reaction networks , author=. IEEE/ACM Transactions on Computational Biology and Bioinformatics , volume=. 2019 , publisher=

2019
[7]

State-estimators for Chemical Reaction Networks of

Chaves, Madalena and Sontag, Eduardo D , journal=. State-estimators for Chemical Reaction Networks of. 2002 , publisher=

work page 2002

Show all 39 references

[8]

SIAM Journal on Control and Optimization , volume=

Input-to-state stability of rate-controlled biochemical networks , author=. SIAM Journal on Control and Optimization , volume=. 2005 , publisher=

2005
[9]

Science , volume=

A synthetic protein-level neural network in mammalian cells , author=. Science , volume=. 2024 , publisher=

2024
[10]

Supervised learning in

Cherry, Kevin M and Qian, Lulu , journal=. Supervised learning in. 2025 , publisher=

2025
[11]

Journal of Mathematical Chemistry , volume=

Identifiability of chemical reaction networks , author=. Journal of Mathematical Chemistry , volume=. 2008 , publisher=

2008
[12]

SIAM Journal on Applied Mathematics , volume=

Persistence and permanence of mass-action and power-law dynamical systems , author=. SIAM Journal on Applied Mathematics , volume=. 2013 , publisher=

2013
[13]

SIAM Journal on Applied Mathematics , volume=

An efficient characterization of complex-balanced, detailed-balanced, and weakly reversible systems , author=. SIAM Journal on Applied Mathematics , volume=. 2020 , publisher=

2020
[14]

SIAM Journal on Applied Mathematics , volume=

An algorithm for finding weakly reversible deficiency zero realizations of polynomial dynamical systems , author=. SIAM Journal on Applied Mathematics , volume=. 2023 , publisher=

2023
[16]

Nonlinearity , volume=

The structure of the toric locus of a reaction network , author=. Nonlinearity , volume=. 2025 , publisher=

2025
[17]

SIAM Journal on Applied Dynamical Systems , volume=

Source-only realizations, weakly reversible deficiency one networks, and dynamical equivalence , author=. SIAM Journal on Applied Dynamical Systems , volume=. 2023 , publisher=

2023
[18]

Automatic Implementation of Neural Networks through Reaction Networks-Part

Fan, Yuzhen and Zhang, Xiaoyu and Gao, Chuanhou and Dochain, Denis , journal=. Automatic Implementation of Neural Networks through Reaction Networks-Part. 2025 , publisher=

2025
[19]

SIAM Journal on Applied Dynamical Systems , volume=

Lyapunov function partial differential equations for chemical reaction networks: Some special cases , author=. SIAM Journal on Applied Dynamical Systems , volume=. 2019 , publisher=

2019
[20]

Chemical reaction network structure and the stability of complex isothermal reactors—

Feinberg, Martin , journal=. Chemical reaction network structure and the stability of complex isothermal reactors—. 1987 , publisher=

1987
[21]

2019 , publisher=

Foundations of chemical reaction network theory , author=. 2019 , publisher=

2019
[22]

SIAM Journal on Applied Dynamical Systems , volume=

A geometric approach to the global attractor conjecture , author=. SIAM Journal on Applied Dynamical Systems , volume=. 2014 , publisher=

2014
[23]

Journal of Mathematical Biology , volume=

Stationary distributions via decomposition of stochastic reaction networks , author=. Journal of Mathematical Biology , volume=. 2021 , publisher=

2021
[24]

Communications Biology , volume=

Derivation of stationary distributions of biochemical reaction networks via structure transformation , author=. Communications Biology , volume=. 2021 , publisher=

2021
[25]

Archive for Rational Mechanics and Analysis , volume=

General mass action kinetics , author=. Archive for Rational Mechanics and Analysis , volume=. 1972 , publisher=

1972
[26]

Archive for Rational Mechanics and Analysis , volume=

Necessary and sufficient conditions for complex balancing in chemical kinetics , author=. Archive for Rational Mechanics and Analysis , volume=. 1972 , publisher=

1972
[27]

arXiv preprint arXiv:2506.12056 , year=

Input-to-state stability-based chemical reaction networks composition for molecular computations , author=. arXiv preprint arXiv:2506.12056 , year=

arXiv
[28]

Automatica , volume=

Structure-conditioned input-to-state stability for layer-by-layer molecular computations in parallel chemical reaction networks , author=. Automatica , volume=. 2026 , publisher=

2026
[29]

Journal of Mathematical Chemistry , volume=

Linear conjugacy of chemical reaction networks , author=. Journal of Mathematical Chemistry , volume=. 2011 , publisher=

2011
[30]

Journal of Mathematical Chemistry , volume=

A linear programming approach to weak reversibility and linear conjugacy of chemical reaction networks , author=. Journal of Mathematical Chemistry , volume=. 2012 , publisher=

2012
[31]

Mathematical Biosciences , volume=

Computing weakly reversible linearly conjugate chemical reaction networks with minimal deficiency , author=. Mathematical Biosciences , volume=. 2013 , publisher=

2013
[32]

SIAM Journal on Applied Mathematics , volume=

Complex balancing reconstructed to the asymptotic stability of mass-action chemical reaction networks with conservation laws , author=. SIAM Journal on Applied Mathematics , volume=. 2019 , publisher=

2019
[33]

PLoS Computational Biology , volume=

A protein turnover signaling motif controls the stimulus-sensitivity of stress response pathways , author=. PLoS Computational Biology , volume=. 2013 , publisher=

2013
[34]

Journal of Biological Chemistry , volume=

Biogenesis of p53 Involves Cotranslational Dimerization of Monomers and Posttranslational Dimerization of Dimers: IMPLICATIONS ON THE DOMINANT NEGATIVE EFFECT , author=. Journal of Biological Chemistry , volume=. 2002 , publisher=

2002
[35]

IEEE Transactions on Automatic Control , volume=

Smooth stabilization implies coprime factorization , author=. IEEE Transactions on Automatic Control , volume=. 1989 , doi=

1989
[36]

MATCH Communications in Mathematical and in Computer Chemistry , volume=

Finding weakly reversible realizations of chemical reaction networks using optimization , author=. MATCH Communications in Mathematical and in Computer Chemistry , volume=
[37]

1977 , publisher=

Stability theory by Liapunov's direct method , author=. 1977 , publisher=

1977
[38]

Plos One , volume=

Persistence and stability of generalized ribosome flow models with time-varying transition rates , author=. Plos One , volume=. 2023 , publisher=

2023
[39]

Proceedings of the National Academy of Sciences , volume=

Programming and training rate-independent chemical reaction networks , author=. Proceedings of the National Academy of Sciences , volume=. 2022 , publisher=

2022

Pith tools

Reviewed August 14, 2026 · model on record in the stance chip above.

[1] [15]

Discrete and Continuous Dynamical Systems-B , volume=

Weakly reversible deficiency one realizations of polynomial dynamical systems , author=. Discrete and Continuous Dynamical Systems-B , volume=. 2024 , publisher=

work page 2024

[2] [1]

Bulletin of Mathematical Biology , volume=

Lyapunov functions, stationary distributions, and non-equilibrium potential for reaction networks , author=. Bulletin of Mathematical Biology , volume=. 2015 , publisher=

work page 2015

[3] [2]

Journal of the Royal Society Interface , volume=

On reaction network implementations of neural networks , author=. Journal of the Royal Society Interface , volume=. 2021 , doi=

work page 2021

[4] [3]

Chemical mass-action systems as analog computers:

Anderson, David F and Joshi, Badal , journal=. Chemical mass-action systems as analog computers:. 2025 , publisher=

work page 2025

[5] [4]

SIAM Journal on Applied Mathematics , volume=

Persistence results for chemical reaction networks with time-dependent kinetics and no global conservation laws , author=. SIAM Journal on Applied Mathematics , volume=. 2011 , publisher=

2011

[6] [5]

SIAM Journal on Mathematical Analysis , volume=

Existence of positive steady states for weakly reversible mass-action systems , author=. SIAM Journal on Mathematical Analysis , volume=. 2019 , publisher=

work page 2019

[7] [6]

IEEE/ACM Transactions on Computational Biology and Bioinformatics , volume=

Composable rate-independent computation in continuous chemical reaction networks , author=. IEEE/ACM Transactions on Computational Biology and Bioinformatics , volume=. 2019 , publisher=

2019

[8] [7]

State-estimators for Chemical Reaction Networks of

Chaves, Madalena and Sontag, Eduardo D , journal=. State-estimators for Chemical Reaction Networks of. 2002 , publisher=

work page 2002