从结构化文档的部分副本中提取一致性的树自动机
Tree Automata for Extracting Consensus from Partial Replicas of a Structured Document
摘要：
在结构化文档的异步协作编辑工作流中，每个共同作者在编辑过程的不同阶段接收文档的副本以插入其贡献。出于保密原因，该副本可能只是部分复制件，其中仅包含（全球）文件中被认为是共同作者感兴趣的部分。请注意，某些部分可能是共同作者表现出的兴趣;因此，它们可以同时访问。在同步时（例如，在过程的异步编辑阶段结束时），我们希望将所有作者的所有贡献合并到单个文档中。由于编辑的非一致性和提供并发访问的文档部分的潜在存在，可能会出现冲突，并使部分副本整体上不可合并：它们是不一致的，这意味着它们包含冲突部分。本文的目的是提出一个合并方法表示的共识，这种部分副本使用树自动机。具体来说，从部分副本更新，我们建立一个树自动机，完全接受共识文件。这些文档是不包含合并的部分副本冲突的最大前缀。
英文摘要：
In an asynchronous cooperative editing workflow of a structured document, each of the co-authors receives in the different phases of the editing process, a copy of the document to insert its contribution. For confidentiality reasons, this copy may be only a partial replica containing only parts of the (global) document which are of demonstrated interest for the considered co-author. Note that some parts may be a demonstrated interest over a co-author; they will therefore be accessible concurrently. When it's synchronization time (e.g. at the end of an asynchronous editing phase of the process), we want to merge all contributions of all authors in a single document. Due to the asynchronism of edition and to the potential existence of the document parts offering concurrent access, conflicts may arise and make partial replicas unmergeable in their entirety: they are inconsistent, meaning that they contain conflictual parts. The purpose of this paper is to propose a merging approach said by consensus of such partial replicas using tree automata. Specifically, from the partial replicas updates, we build a tree automaton that accepts exactly the consensus documents. These documents are the maximum prefixes containing no conflict of partial replicas merged.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
