A Formal Approach for Tuning Stochastic Oscillators

Paolo BallariniMICS, Mahmoud Bentriou, Paul-Henry Cournède
{"title":"A Formal Approach for Tuning Stochastic Oscillators","authors":"Paolo BallariniMICS, Mahmoud Bentriou, Paul-Henry Cournède","doi":"arxiv-2405.09183","DOIUrl":null,"url":null,"abstract":"Periodic recurrence is a prominent behavioural of many biological phenomena,\nincluding cell cycle and circadian rhythms. Although deterministic models are\ncommonly used to represent the dynamics of periodic phenomena, it is known that\nthey are little appropriate in the case of systems in which stochastic noise\ninduced by small population numbers is actually responsible for periodicity.\nWithin the stochastic modelling settings automata-based model checking\napproaches have proven an effective means for the analysis of oscillatory\ndynamics, the main idea being that of coupling a period detector automaton with\na continuous-time Markov chain model of an alleged oscillator. In this paper we\naddress a complementary aspect, i.e. that of assessing the dependency of\noscillation related measure (period and amplitude) against the parameters of a\nstochastic oscillator. To this aim we introduce a framework which, by combining\nan Approximate Bayesian Computation scheme with a hybrid automata capable of\nquantifying how distant an instance of a stochastic oscillator is from matching\na desired (average) period, leads us to identify regions of the parameter space\nin which oscillation with given period are highly likely. The method is\ndemonstrated through a couple of case studies, including a model of the popular\nRepressilator circuit.","PeriodicalId":501124,"journal":{"name":"arXiv - CS - Formal Languages and Automata Theory","volume":"33 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Formal Languages and Automata Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2405.09183","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Periodic recurrence is a prominent behavioural of many biological phenomena, including cell cycle and circadian rhythms. Although deterministic models are commonly used to represent the dynamics of periodic phenomena, it is known that they are little appropriate in the case of systems in which stochastic noise induced by small population numbers is actually responsible for periodicity. Within the stochastic modelling settings automata-based model checking approaches have proven an effective means for the analysis of oscillatory dynamics, the main idea being that of coupling a period detector automaton with a continuous-time Markov chain model of an alleged oscillator. In this paper we address a complementary aspect, i.e. that of assessing the dependency of oscillation related measure (period and amplitude) against the parameters of a stochastic oscillator. To this aim we introduce a framework which, by combining an Approximate Bayesian Computation scheme with a hybrid automata capable of quantifying how distant an instance of a stochastic oscillator is from matching a desired (average) period, leads us to identify regions of the parameter space in which oscillation with given period are highly likely. The method is demonstrated through a couple of case studies, including a model of the popular Repressilator circuit.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
调整随机振荡器的正式方法
周期性复发是许多生物现象(包括细胞周期和昼夜节律)的显著行为特征。虽然确定性模型通常用于表示周期现象的动力学,但众所周知,在由少量种群引起的随机噪声实际上是周期性的原因的系统中,确定性模型并不合适。在随机建模环境中,基于自动机的模型检查方法已被证明是分析振荡动力学的有效手段,其主要思想是将周期检测自动机与所谓振荡器的连续时间马尔可夫链模型耦合。在本文中,我们讨论了一个互补的方面,即评估振荡相关度量(周期和振幅)与随机振荡器参数的依赖关系。为此,我们引入了一个框架,通过将近似贝叶斯计算方案与能够量化随机振荡器实例与期望(平均)周期匹配程度的混合自动机相结合,我们可以识别出参数空间中极有可能出现给定周期振荡的区域。我们将通过几个案例研究来演示这种方法,其中包括一个流行的减压电路模型。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Query Learning of Advice and Nominal Automata Well-Behaved (Co)algebraic Semantics of Regular Expressions in Dafny Run supports and initial algebra supports of weighted automata Alternating hierarchy of sushifts defined by nondeterministic plane-walking automata $\mathbb{N}$-polyregular functions arise from well-quasi-orderings
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1