AI 中文总结
研究如何改进齐隆卡型构造以支持具有连通通信进程的DFA规范，放宽公平性约束。核心方法是改进构造，使其在进程局部状态数量为DFA状态数多项式，仅参数d和分离深度有指数增长，实现了更高效的分布式实现。
AI 中文摘要
给定一个作为迹闭正则语言的全局规范，齐隆卡定理提供了一种构造方法，用于合成一种语言等价的分布式实现，该实现表示为确定性异步自动机（AA）。该构造非常复杂，导致一系列工作考虑对规范或分布式架构的限制，目的是提供概念上更简单的构造。最近为“公平”规范提供了一种新构造，其中所有进程定期参与。在这项工作中，我们改进了这种构造，以实现具有“连通通信进程”的确定性有限状态自动机（DFA）规范：应该存在一个固定延迟d，使得如果两个进程在此延迟后没有收到彼此的消息，那么在运行结束之前它们将再也不会收到彼此的消息。这是公平性约束的一种放宽，其中某个进程可能故意停止与另一个进程通信，例如在客户端 - 服务器架构中，如果客户端一段时间后没有从服务器获得任何响应，它就会停止向服务器请求资源。我们的构造产生一个AA，其中每个进程具有的局部状态数量是DFA状态数量的多项式，并且唯一的指数级增长与参数d和进程的分离深度有关。
英文摘要
Given a global specification as a trace-closed regular language, Zielonka's theorem provides a construction to synthesise a language equivalent distributed implementation represented as a deterministic asynchronous automaton (AA). The construction is notoriously complicated, which has led to a line of work that considers restrictions on the specifications or on the distributed architectures, with the objective of providing a conceptually simpler construction. A new construction has recently been provided for "fair" specifications, in which all processes participate regularly. In this work, we enhance this construction to enable deterministic finite-state automata (DFA) specifications with "connectedly communicating processes": there should be a constant delay d such that if two processes do not hear from one another after this delay, they will never hear from one another until the end of the run. This is a relaxation of the fairness constraint, in which some process may deliberately stop communicating with another one, e.g. a client-server architecture, where a client stops asking the server for a resource if it did not get any response from it after a while. Our construction results in an AA where every process has a number of local states that is polynomial in the number of states of the DFA, and where the only exponential explosion is related to the parameter d, and the separation depth of processes.
