arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1603.03252cs.LOcs.PF
收藏

固定时延CTMC中最优超时综合对PRISM的扩展

Extension of PRISM by Synthesis of Optimal Timeouts in Fixed-Delay CTMC

Ľuboš Korenčiak, Vojtěch Řehák, Adrian Farmadin

摘要:

我们提出了一个实际上有吸引力的扩展的概率模型检查PRISM渲染它来处理固定延迟连续时间马尔可夫链(FDCTMCs)的奖励,等价的形式主义的确定性和随机Petri网(DSPN)。fdCTMC允许在具有指数速率的传统转换之上具有固定延迟(或超时)的转换。我们的扩展支持预期奖励的评估,直到达到一组给定的目标状态。主要贡献是,考虑固定延迟作为参数,我们实现了一个合成算法,计算最小化预期回报的固定延迟的ε-最优值。我们提供了一个性能评估的综合实例。

英文摘要:

We present a practically appealing extension of the probabilistic model checker PRISM rendering it to handle fixed-delay continuous-time Markov chains (fdCTMCs) with rewards, the equivalent formalism to the deterministic and stochastic Petri nets (DSPNs). fdCTMCs allow transitions with fixed-delays (or timeouts) on top of the traditional transitions with exponential rates. Our extension supports an evaluation of expected reward until reaching a given set of target states. The main contribution is that, considering the fixed-delays as parameters, we implemented a synthesis algorithm that computes the epsilon-optimal values of the fixed-delays minimizing the expected reward. We provide a performance evaluation of the synthesis on practical examples.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑