Complexity of model checking for reaction systems.

Theoretical Computer Science(2016)

引用 35|浏览64
暂无评分
摘要
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.
更多
查看译文
关键词
Reaction systems,Model checking,Biomodeling,Conserved sets,Invariants,Steady state,Stationary process,Elementary flux,Periodicity,Complexity classes
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要