Paolo BallariniMICS, Mahmoud Bentriou, Paul-Henry Cournède
{"title":"调整随机振荡器的正式方法","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":"{\"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}","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}
A Formal Approach for Tuning Stochastic Oscillators
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.