Structural polyhedral stability of a biochemical network is equivalent to finiteness of the associated generalised Petri net
We consider biochemical systems associated with a generalised class of Petri nets with possibly negative token numbers. We show that the existence of a structural polyhedral Lyapunov function for the biochemical system is equivalent to the boundedness of the associated Petri net evolution or, equivalently, to the finiteness of the number of states reachable from each initial condition. For networks that do not admit a polyhedral Lyapunov function, we investigate whether it is possible to enforce polyhedral structural stability by applying a strong negative feedback on some pinned nodes: in terms of the Petri net, this is equivalent to turning pinned nodes into black holes that clear any positive or negative incoming token. If such nodes are chosen so that the transformed Petri net has bounded discrete trajectories, then there exists a stabilising pinning control: the biochemical network becomes Lyapunov stable if a sufficiently strong local negative feedback is applied to the pinned nodes. These results allow us to structurally identify the critical nodes to be locally controlled so as to ensure the stability of the whole network.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
A Simple Comparison of Biochemical Systems Theory and Metabolic Control Analysis
This paper explores some basic concepts of Biochemical Systems Theory (BST) and Metabolic Control Analysis (MCA), two frameworks developed to understand the behavior of biochemical networks. Initially introduced by Savag…
Abstraction-based Probabilistic Stability Analysis of Polyhedral Probabilistic Hybrid Systems
In this paper, we consider the problem of probabilistic stability analysis of a subclass of Stochastic Hybrid Systems, namely, Polyhedral Probabilistic Hybrid Systems (PPHS), where the flow dynamics is given by a polyhed…
SOC-ICNN: From Polyhedral to Conic Geometry for Learning Convex Surrogate Functions
Classical ReLU-based Input Convex Neural Networks (ICNNs) are equivalent to the optimal value functions of Linear Programming (LP). This intrinsic structural equivalence restricts their representational capacity to piece…
Automated Neuron Labelling Enables Generative Steering and Interpretability in Protein Language Models
Protein language models (PLMs) encode rich biological information, yet their internal neuron representations are poorly understood. We introduce the first automated framework for labeling every neuron in a PLM with biolo…
Polyhedral Instability Governs Regret in Online Learning
Many online decision problems over combinatorial actions are addressed via convex relaxations, leading to online convex optimization with piecewise linear objectives and induced polyhedral structure. We show that regret …