连续时间马尔可夫链的表达逻辑

Fourth International Conference on the Quantitative Evaluation of Systems (QEST 2007) Pub Date : 1900-01-01 DOI:10.1109/QEST.2007.40

S. Donatelli, S. Haddad, J. Sproston

{"title":"连续时间马尔可夫链的表达逻辑","authors":"S. Donatelli, S. Haddad, J. Sproston","doi":"10.1109/QEST.2007.40","DOIUrl":null,"url":null,"abstract":"The stochastic temporal logic CSL can be used to describe formally properties of continuous-time Markov chains, and has been extended with expressions over states and actions to obtain the logic asCSL. However, properties referring to the probability of a finite sequence of timed events (such as \"with probability at least 0.75, the system will be in state set A at time 5, then in state set B at time 7, then in state set C at time 20\") cannot be expressed in either CSL or asCSL. With the aim of increasing the expressive power of temporal logics for continuous- time Markov chains, we introduce the logic CSLTA and its model-checking algorithm. CSLTA extends CSL and asCSL by allowing the specification of timed properties through a deterministic one-clock timed automata.","PeriodicalId":249627,"journal":{"name":"Fourth International Conference on the Quantitative Evaluation of Systems (QEST 2007)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"22","resultStr":"{\"title\":\"CSL^TA: an Expressive Logic for Continuous-Time Markov Chains\",\"authors\":\"S. Donatelli, S. Haddad, J. Sproston\",\"doi\":\"10.1109/QEST.2007.40\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The stochastic temporal logic CSL can be used to describe formally properties of continuous-time Markov chains, and has been extended with expressions over states and actions to obtain the logic asCSL. However, properties referring to the probability of a finite sequence of timed events (such as \\\"with probability at least 0.75, the system will be in state set A at time 5, then in state set B at time 7, then in state set C at time 20\\\") cannot be expressed in either CSL or asCSL. With the aim of increasing the expressive power of temporal logics for continuous- time Markov chains, we introduce the logic CSLTA and its model-checking algorithm. CSLTA extends CSL and asCSL by allowing the specification of timed properties through a deterministic one-clock timed automata.\",\"PeriodicalId\":249627,\"journal\":{\"name\":\"Fourth International Conference on the Quantitative Evaluation of Systems (QEST 2007)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"22\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Fourth International Conference on the Quantitative Evaluation of Systems (QEST 2007)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/QEST.2007.40\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Fourth International Conference on the Quantitative Evaluation of Systems (QEST 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/QEST.2007.40","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 22

摘要

随机时间逻辑CSL可以用来形式化地描述连续时间马尔可夫链的性质，并将其扩展为状态和动作的表达式，从而得到随机时间逻辑CSL。然而，涉及有限时间事件序列的概率的属性(例如“在概率至少为0.75的情况下，系统将在时间5时处于状态集a，然后在时间7时处于状态集B，然后在时间20时处于状态集C”)无法在CSL或asCSL中表示。为了提高时间逻辑对连续时间马尔可夫链的表达能力，我们引入了时间逻辑CSLTA及其模型检验算法。CSLTA扩展了CSL和asCSL，允许通过确定性的单时钟时间自动机来规范时间属性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

CSL^TA: an Expressive Logic for Continuous-Time Markov Chains

The stochastic temporal logic CSL can be used to describe formally properties of continuous-time Markov chains, and has been extended with expressions over states and actions to obtain the logic asCSL. However, properties referring to the probability of a finite sequence of timed events (such as "with probability at least 0.75, the system will be in state set A at time 5, then in state set B at time 7, then in state set C at time 20") cannot be expressed in either CSL or asCSL. With the aim of increasing the expressive power of temporal logics for continuous- time Markov chains, we introduce the logic CSLTA and its model-checking algorithm. CSLTA extends CSL and asCSL by allowing the specification of timed properties through a deterministic one-clock timed automata.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Fourth International Conference on the Quantitative Evaluation of Systems (QEST 2007)

自引率

0.00%

发文量