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.


page 24

page 25


Time-position characterization of conflicts: a case study of collaborative editing

Collaborative editing (CE) became increasingly common, often compulsory ...

Asynchronous Consensus Algorithm

This document describes a new consensus algorithm which is asynchronous ...

Copy that! Editing Sequences by Copying Spans

Neural sequence-to-sequence models are finding increasing use in editing...

Understanding and representing the semantics of large structured documents

Understanding large, structured documents like scholarly articles, reque...

KBSET -- Knowledge-Based Support for Scholarly Editing and Text Processing

KBSET supports a practical workflow for scholarly editing, based on usin...

A Tree Pattern Matching Algorithm for XML Queries with Structural Preferences

In the XML community, exact queries allow users to specify exactly what ...

Please sign up or login with your details

Forgot password? Click here to reset