Abstract
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.
Highlights
A significant proportion of documents handled and/or exchanged by applications has a regular structure defined by a grammatical model (DTD: Document Type Definition, schema [1]): they are called structured documents
This paper proposes an approach of detection and resolution of such conflicts by consensus during the synchronisation-redistribution phase, using a tree automaton said of consensus, to represent all documents that are the consensus of competing editions realised on the different partial replicas
We introduce below the definition of the synchronous product of k tree automata whose adaptation will be used for the derivation of the consensual automaton
Summary
A significant proportion of documents handled and/or exchanged by applications has a regular structure defined by a grammatical model (DTD: Document Type Definition, schema [1]): they are called structured documents. The process for obtaining the documents forming part of the consensus is: 1) for each update timaj of a partial replica ti , we associate a tree automaton with exit states A (i) recognizing the trees (conform to the global model) for which timaj is a projection [9].
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have