注册协议在网络中的随机可达性
Reachability in Networks of Register Protocols under Stochastic Schedulers
摘要:
我们研究的几乎肯定的可达性问题,在分布式系统中获得的异步组合的N个副本(称为进程)的同一个自动机(称为协议),可以通过一个共享寄存器与有限域进行通信。自动机有两种类型的转换:写转换更新寄存器的值,而读转换根据寄存器的内容移动到一个新的状态。非确定性是解决了随机调度。给定一个协议,我们专注于一个进程的目标状态的几乎肯定的可达性。这个问题的答案自然取决于进程的数量N。然而,我们证明了我们的设置有一个截止属性:几乎肯定的可达性问题的答案是恒定的,当N是足够大的,然后我们开发了一个EXPSPACE算法,决定这个恒定的答案是积极的还是消极的。
英文摘要:
We study the almost-sure reachability problem in a distributed system obtained as the asynchronous composition of N copies (called processes) of the same automaton (called protocol), that can communicate via a shared register with finite domain. The automaton has two types of transitions: write-transitions update the value of the register, while read-transitions move to a new state depending on the content of the register. Non-determinism is resolved by a stochastic scheduler. Given a protocol, we focus on almost-sure reachability of a target state by one of the processes. The answer to this problem naturally depends on the number N of processes. However, we prove that our setting has a cut-off property: the answer to the almost-sure reachability problem is constant when N is large enough; we then develop an EXPSPACE algorithm deciding whether this constant answer is positive or negative.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。