Complexity of model checking for reaction systems

A1 Originalartikel i en vetenskaplig tidskrift (referentgranskad)


Interna författare/redaktörer


Publikationens författare: Sepinoud Azimi, Cristian Gratie, Sergiu Ivanov, Luca Manzoni, Ion Petre , Antonio E. Porreca
Förläggare: Elsevier
Publiceringsår: 2016
Tidskrift: Theoretical Computer Science
Volym: 623
Artikelns första sida, sidnummer: 103
Artikelns sista sida, sidnummer: 113


Abstrakt

Reaction systems are a new mathematical formalism inspired by the living cell and driven by only two basic mechanisms: facilitation and inhibition. As a modeling framework, they differ from the traditional approaches based on ODEs and CTMCs in two fundamental aspects: their qualitative character and the non-permanency of resources. In this article we introduce to reaction systems several notions of central interest in biomodeling: mass conservation, invariants, steady states, stationary processes, elementary fluxes, and periodicity. We prove that the decision problems related to these properties span a number of complexity classes from P to NP- and coNP-complete to PSPACE-complete.

Senast uppdaterad 2019-21-11 vid 05:22