Abstraction-Based Segmental Simulation of Chemical Reaction Networks

Martin Helfrich, Milan Ceska, Jan Křetínský, Stefan Marticek
{"title":"Abstraction-Based Segmental Simulation of Chemical Reaction Networks","authors":"Martin Helfrich, Milan Ceska, Jan Křetínský, Stefan Marticek","doi":"10.48550/arXiv.2206.06677","DOIUrl":null,"url":null,"abstract":"Simulating chemical reaction networks is often computationally demanding, in particular due to stiffness. We propose a novel simulation scheme where long runs are not simulated as a whole but assembled from shorter precomputed segments of simulation runs. On the one hand, this speeds up the simulation process to obtain multiple runs since we can reuse the segments. On the other hand, questions on diversity and genuineness of our runs arise. However, we ensure that we generate runs close to their true distribution by generating an appropriate abstraction of the original system and utilizing it in the simulation process. Interestingly, as a by-product, we also obtain a yet more efficient simulation scheme, yielding runs over the system's abstraction. These provide a very faithful approximation of concrete runs on the desired level of granularity, at a low cost. Our experiments demonstrate the speedups in the simulations while preserving key dynamical as well as quantitative properties.","PeriodicalId":433620,"journal":{"name":"Computational Methods in Systems Biology","volume":"76 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computational Methods in Systems Biology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.48550/arXiv.2206.06677","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Simulating chemical reaction networks is often computationally demanding, in particular due to stiffness. We propose a novel simulation scheme where long runs are not simulated as a whole but assembled from shorter precomputed segments of simulation runs. On the one hand, this speeds up the simulation process to obtain multiple runs since we can reuse the segments. On the other hand, questions on diversity and genuineness of our runs arise. However, we ensure that we generate runs close to their true distribution by generating an appropriate abstraction of the original system and utilizing it in the simulation process. Interestingly, as a by-product, we also obtain a yet more efficient simulation scheme, yielding runs over the system's abstraction. These provide a very faithful approximation of concrete runs on the desired level of granularity, at a low cost. Our experiments demonstrate the speedups in the simulations while preserving key dynamical as well as quantitative properties.
基于抽象的化学反应网络分段模拟
模拟化学反应网络通常需要大量的计算,特别是由于刚度。我们提出了一种新的模拟方案,其中长距离运行不是作为一个整体进行模拟,而是由较短的预先计算的模拟运行段组装而成。一方面,这加快了模拟过程以获得多次运行,因为我们可以重用这些段。另一方面,关于我们跑步的多样性和真实性的问题也出现了。然而,我们通过生成原始系统的适当抽象并在仿真过程中利用它来确保我们生成的运行接近其真实分布。有趣的是,作为一个副产品,我们也获得了一个更有效的仿真方案,产生了对系统抽象的运行。这些方法以较低的成本在所需的粒度水平上提供了非常可靠的近似混凝土运行。我们的实验证明了模拟中的加速,同时保留了关键的动力学和定量特性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信