arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2207.02045cs.LO
收藏

掩蔽容错的随机博弈方法:互模拟和量化

A Stochastic Game Approach to Masking Fault-Tolerance: Bisimulation and Quantification

Pablo F. Castro, Pedro D'Argenio, Luciano Putruele, Ramiro Demasi

摘要:

我们引入了一个正式的概念掩蔽容错概率转移系统之间的一个变种的基础上的概率互模拟(称为掩蔽模拟)。我们还提供了相应的概率博弈特征。即使这些游戏可能是无限的,我们提出了一个象征性的方式来表示它们,这样,它可以决定在多项式时间,如果有两个概率转移系统之间的掩蔽模拟。我们使用这个掩蔽的概念来量化几乎肯定失败的系统所表现出的掩蔽容错水平,即,那些最终以概率1失败的系统几乎必然失效系统的掩蔽容错水平可以通过求解一组函数方程来计算。我们在最小化玩家以强公平方式(模仿公平环境的想法)行为的设置中产生这个度量,并将我们的研究限制在无记忆策略上,因为游戏的无限性质。我们在一个原型工具中实现了这些想法,并进行了实验评估。

英文摘要:

We introduce a formal notion of masking fault-tolerance between probabilistic transition systems based on a variant of probabilistic bisimulation (named masking simulation). We also provide the corresponding probabilistic game characterization. Even though these games could be infinite, we propose a symbolic way of representing them, such that it can be decided in polynomial time if there is a masking simulation between two probabilistic transition systems. We use this notion of masking to quantify the level of masking fault-tolerance exhibited by almost-sure failing systems, i.e., those systems that eventually fail with probability 1. The level of masking fault-tolerance of almost-sure failing systems can be calculated by solving a collection of functional equations. We produce this metric in a setting in which the minimizing player behaves in a strong fair way (mimicking the idea of fair environments), and limit our study to memoryless strategies due to the infinite nature of the game. We implemented these ideas in a prototype tool, and performed an experimental evaluation.

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

↑