CUT:结合随机排序和审查来约束稳态奖励和首次通过时间

Fourth International Conference on the Quantitative Evaluation of Systems (QEST 2007) Pub Date : 2007-09-17 DOI:10.1109/QEST.2007.35

J. Fourneau, N. Pekergin, S. Younès

{"title":"CUT:结合随机排序和审查来约束稳态奖励和首次通过时间","authors":"J. Fourneau, N. Pekergin, S. Younès","doi":"10.1109/QEST.2007.35","DOIUrl":null,"url":null,"abstract":"We have designed a tool to partition a Markov Chain and have used the censoring technique and strong stochastic comparison to obtain bounds on rewards and the first passage time. We present the main ideas of the method, the algorithms, the tool and some numerical results.","PeriodicalId":249627,"journal":{"name":"Fourth International Conference on the Quantitative Evaluation of Systems (QEST 2007)","volume":"86 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"CUT : Combining stochastic ordering and censoring to bound steady-state rewards and first passage time\",\"authors\":\"J. Fourneau, N. Pekergin, S. Younès\",\"doi\":\"10.1109/QEST.2007.35\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We have designed a tool to partition a Markov Chain and have used the censoring technique and strong stochastic comparison to obtain bounds on rewards and the first passage time. We present the main ideas of the method, the algorithms, the tool and some numerical results.\",\"PeriodicalId\":249627,\"journal\":{\"name\":\"Fourth International Conference on the Quantitative Evaluation of Systems (QEST 2007)\",\"volume\":\"86 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-09-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"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.35\",\"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.35","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 4

摘要

我们设计了一个划分马尔可夫链的工具，并使用审查技术和强随机比较来获得奖励和首次通过时间的界限。给出了该方法的主要思想、算法、工具和一些数值结果。

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

查看原文本刊更多论文

CUT : Combining stochastic ordering and censoring to bound steady-state rewards and first passage time

We have designed a tool to partition a Markov Chain and have used the censoring technique and strong stochastic comparison to obtain bounds on rewards and the first passage time. We present the main ideas of the method, the algorithms, the tool and some numerical results.

求助全文

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

来源期刊

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

自引率

0.00%

发文量