{"title":"连续随机逻辑的贝叶斯统计模型检验","authors":"Ratan Lal, Weikang Duan, P. Prabhakar","doi":"10.1109/MEMOCODE51338.2020.9315001","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a Bayesian approach to statistical model-checking (SMC) of discrete-time Markov chains with respect to continuous stochastic logic (CSL) specifications. While Bayesian approaches for simpler logic without nested probabilistic operators and Frequentist approaches for nested logic have been previously explored, the Bayesian approach for CSL consisting of nested probabilistic operators has not been addressed. The challenge in the nested case arises from the fact that unlike in probabilistic model-checking (PMC), where we obtain a definitive answer for the model-checking problem for the sub-formulas, instead, we only obtain a correct answer with a certain confidence, which needs to be factored into the recursive SMC algorithm. Here, we propose a Bayesian test based algorithm for CSL that has nested probabilistic operators. We have implemented our algorithm in a Python Toolbox. Our experimental evaluation shows that our Bayesian SMC approach performs better than both the frequentist SMC approach and PMC algorithms.","PeriodicalId":212741,"journal":{"name":"2020 18th ACM-IEEE International Conference on Formal Methods and Models for System Design (MEMOCODE)","volume":"72 7","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Bayesian Statistical Model Checking for Continuous Stochastic Logic\",\"authors\":\"Ratan Lal, Weikang Duan, P. Prabhakar\",\"doi\":\"10.1109/MEMOCODE51338.2020.9315001\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we propose a Bayesian approach to statistical model-checking (SMC) of discrete-time Markov chains with respect to continuous stochastic logic (CSL) specifications. While Bayesian approaches for simpler logic without nested probabilistic operators and Frequentist approaches for nested logic have been previously explored, the Bayesian approach for CSL consisting of nested probabilistic operators has not been addressed. The challenge in the nested case arises from the fact that unlike in probabilistic model-checking (PMC), where we obtain a definitive answer for the model-checking problem for the sub-formulas, instead, we only obtain a correct answer with a certain confidence, which needs to be factored into the recursive SMC algorithm. Here, we propose a Bayesian test based algorithm for CSL that has nested probabilistic operators. We have implemented our algorithm in a Python Toolbox. Our experimental evaluation shows that our Bayesian SMC approach performs better than both the frequentist SMC approach and PMC algorithms.\",\"PeriodicalId\":212741,\"journal\":{\"name\":\"2020 18th ACM-IEEE International Conference on Formal Methods and Models for System Design (MEMOCODE)\",\"volume\":\"72 7\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-12-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 18th ACM-IEEE International Conference on Formal Methods and Models for System Design (MEMOCODE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MEMOCODE51338.2020.9315001\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 18th ACM-IEEE International Conference on Formal Methods and Models for System Design (MEMOCODE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MEMOCODE51338.2020.9315001","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Bayesian Statistical Model Checking for Continuous Stochastic Logic
In this paper, we propose a Bayesian approach to statistical model-checking (SMC) of discrete-time Markov chains with respect to continuous stochastic logic (CSL) specifications. While Bayesian approaches for simpler logic without nested probabilistic operators and Frequentist approaches for nested logic have been previously explored, the Bayesian approach for CSL consisting of nested probabilistic operators has not been addressed. The challenge in the nested case arises from the fact that unlike in probabilistic model-checking (PMC), where we obtain a definitive answer for the model-checking problem for the sub-formulas, instead, we only obtain a correct answer with a certain confidence, which needs to be factored into the recursive SMC algorithm. Here, we propose a Bayesian test based algorithm for CSL that has nested probabilistic operators. We have implemented our algorithm in a Python Toolbox. Our experimental evaluation shows that our Bayesian SMC approach performs better than both the frequentist SMC approach and PMC algorithms.