### Abstract

A computation-oriented representation of uncertain kinetic systems is introduced and analysed in this paper. It is assumed that the monomial coefficients of the ODEs belong to a polytopic set, which defines a set of dynamical systems for an uncertain model. An optimization-based computation model is proposed for the structural analysis of uncertain models. It is shown that the so-called dense realization containing the maximal number of reactions (directed edges) is computable in polynomial time, and it forms a superstructure among all the possible reaction graphs corresponding to an uncertain kinetic model, assuming a fixed set of complexes. The set of core reactions present in all reaction graphs of an uncertain model is also studied. Most importantly, an algorithm is proposed to compute all possible reaction graph structures for an uncertain kinetic model.

Original language | English |
---|---|

Pages (from-to) | 83-95 |

Number of pages | 13 |

Journal | Computer Physics Communications |

Volume | 228 |

DOIs | |

Publication status | Published - júl. 2018 |

### Fingerprint

### ASJC Scopus subject areas

- Hardware and Architecture
- Physics and Astronomy(all)

### Cite this

*Computer Physics Communications*,

*228*, 83-95. https://doi.org/10.1016/j.cpc.2018.03.002