On Consistency of Operational Transformation Approach

The Operational Transformation (OT) approach, used in many collaborative editors, allows a group of users to concurrently update replicas of a shared object and exchange their updates in any order. The basic idea of this approach is to transform any received update operation before its execution on a replica of the object. This transformation aims to ensure the convergence of the different replicas of the object, even if the operations are executed in different orders. However, designing transformation functions for achieving convergence is a critical and challenging issue. Indeed, the transformation functions proposed in the literature are all revealed incorrect. This paper investigates the existence of transformations functions which ensure convergence. From the theoretical point of view, two properties, named TP1 and TP2, are necessary and sufficient to ensure convergence. For the basic signatures of insert and delete operations, we show, using controller synthesis technique, that there are some transformation functions, which satisfy TP1. But, there is no transformation function, which satisfies both TP1 and TP2.

[1]  David Sun,et al.  Context-Based Operational Transformation in Distributed Collaborative Editing Systems , 2009, IEEE Transactions on Parallel and Distributed Systems.

[2]  Pascal Molli,et al.  Logoot: A Scalable Optimistic Replication Algorithm for Collaborative Editing on P2P Networks , 2009, 2009 29th IEEE International Conference on Distributed Computing Systems.

[3]  Clarence A. Ellis,et al.  Concurrency control in groupware systems , 1989, SIGMOD '89.

[4]  Joan Manuel Marquès,et al.  A Commutative Replicated Data Type for Cooperative Editing , 2009, 2009 29th IEEE International Conference on Distributed Computing Systems.

[5]  Michaël Rusinowitch,et al.  Formal design and verification of operational transformation algorithms for copies convergence , 2006, Theor. Comput. Sci..

[6]  Hanifa Boucheneb,et al.  On Model-Checking Optimistic Replication Algorithms , 2009, FMOODS/FORTE.

[7]  Michaël Rusinowitch,et al.  Proving Correctness of Transformation Functions in Real-Time Groupware , 2003, ECSCW.

[8]  Jean Ferrié,et al.  Concurrent operations in a distributed and mobile collaborative environment , 1998, Proceedings 14th International Conference on Data Engineering.

[9]  Matthias Ressel,et al.  An integrating, transformation-oriented approach to concurrency control and undo in group editors , 1996, CSCW '96.

[10]  Pascal Molli,et al.  Logoot-Undo: Distributed Collaborative Editing System on P2P Networks , 2010, IEEE Transactions on Parallel and Distributed Systems.

[11]  Kim G. Larsen,et al.  Efficient On-the-Fly Algorithms for the Analysis of Timed Games , 2005, CONCUR.

[12]  Hanifa Boucheneb,et al.  Symbolic Model-Checking of Optimistic Replication Algorithms , 2010, IFM.

[13]  Pascal Molli,et al.  Data consistency for P2P collaborative editing , 2006, CSCW '06.

[14]  Yanchun Zhang,et al.  Achieving convergence, causality preservation, and intention preservation in real-time cooperative editing systems , 1998, TCHI.

[15]  Jean Ferrié,et al.  Serialization of concurrent operations in a distributed collaborative environment , 1997, GROUP.

[16]  Philip A. Bernstein,et al.  Categories and Subject Descriptors: H.2.4 [Database Management]: Systems. , 2022 .

[17]  Chengzheng Sun,et al.  Operational transformation in real-time group editors: issues, algorithms, and achievements , 1998, CSCW '98.

[18]  Nicolas Vidot,et al.  Copies convergence in a distributed real-time collaborative environment , 2000, CSCW '00.