Asynchronous bounded or unbounded message passing is ubiquitous in communication-centric systems. When modelling distributed scenarios, it is important to understand whether buffers are bounded or not. In this paper, we work on the notion of k-synchronizability: a system is k-synchronizable if any of its executions, up to reordering causally independent actions, can be divided into a succession of k-bounded interaction phases. We show two results: first, the reachability problem is decidable for k-synchronizable systems; second, the membership problem (whether a given system is k-synchronizable) is decidable as well. Our proofs fix several important issues in previous attempts to prove these two results.
翻译:以通信为中心的系统无处不在地相互连接或无处不在传递信息。 当模拟分布式假设时,重要的是要了解缓冲是否被捆绑。 在本文件中,我们研究K-同步性的概念:一个系统如果被处决,直到重新排列因果独立的行动,可以分为一系列由 k- 绑定的互动阶段。我们显示了两个结果:首先,可实现性问题对于 k- 同步化系统是可避免的;其次,会籍问题(是否给定的系统是 k- 同步的)也是可以消化的。我们的证据在以前试图证明这两个结果的过程中解决了几个重要问题。