论文标题
从结构化文档的部分复制品中提取共识的树自动机
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.
