An Admissibility-Based Operational Transformation Framework for Collaborative Editing Systems

@article{Li2009AnAO,
  title={An Admissibility-Based Operational Transformation Framework for Collaborative Editing Systems},
  author={Du Li and Rui Li},
  journal={Computer Supported Cooperative Work (CSCW)},
  year={2009},
  volume={19},
  pages={1-43}
}
  • Du LiRui Li
  • Published 1 February 2010
  • Computer Science
  • Computer Supported Cooperative Work (CSCW)
Operational transformation (OT) as a consistency control method has been well accepted in group editors. With OT, the users can edit any part of a shared document at any time and local responsiveness is not sensitive to communication latencies. However, established theoretical frameworks for developing OT algorithms either require transformation functions to work in all possible cases, which complicates the design of transformation functions, or include an under-formalized condition of… 

ABTS: A transformation-based consistency control algorithm for wide-area collaborative applications

  • Bin ShaoDu LiNing Gu
  • Computer Science
    2009 5th International Conference on Collaborative Computing: Networking, Applications and Worksharing
  • 2009
This paper proposes a novel OT algorithm that addresses the above two challenges as follows: first, it is based on a recent theoretical framework with formal conditions such that its correctness can be proved, and secondly, it supports two string-based primitive operations and handles overlapping and splitting of operations.

Constant-time operation transformation and integration for collaborative editing

  • Weihai Yu
  • Computer Science
    7th International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom)
  • 2011
This paper presents an approach that supports string operations and constant-time operation transformation and integration and is based on admissibility preservation, a correctness criterion with which the correctness of the approach can be formally proven.

On Synthesizing a Consistent Operational Transformation Approach

This paper proposes a new transformation function and shows formally that it ensures convergence, and shows that two properties, named TP1 and TP2, are necessary and sufficient to ensure convergence.

Strong eventual consistency of the collaborative editing framework WOOT

A novel approach is used identifying a previously unknown sort-key based protocol that simulates the WOOT framework to show its consistency and formalizes the proof using the Isabelle/HOL proof assistant to machine-check its correctness.

A Constraint-based Approach for Generating Transformation Patterns

Constraint Satisfaction Problem (CSP) theory is used to devise correct and undoable transformation patterns (w.r.t OT and undo properties) which considerably simplifies the design of collaborative objects.

Using CSP for coordinating undo-based collaborative applications

To correctly manipulate undo for a shared object, it is proved that the set of operations of size n • 4 must be totally Commutative, while only a subset of commutative operations is necessary otherwise.

New Algorithms and Methods for Collaborative Co-Editing Using HTML DOM Synchronization

A feedback-based real-time architecture that allows arbitrary DOM-based document replicas to remain consistent by defining a new set of operations that preserve the user's editing intentions is presented.

A Survey on Operational Transformation Algorithms: Challenges, Issues and Achievements

An integrative review of the evolution of operational transformation techniques is presented, discusses major issues, algorithms, achievements and remaining challenges, and does a comparative study of various algorithms of OT based on different parameters.

A Survey on Operational Transformation Algorithms: Challenges, Issues and Achievements

  • X. JiaY. Zhang
  • Computer Science
  • 2017
An integrative review of the evolution of operational transformation techniques is presented, discusses major issues, algorithms, achievements and remaining challenges, and does a comparative study of various algorithms of OT based on different parameters.

Modeling and Simulation of an Operational Transformation Algorithm Using Finite State Machines

  • C. GadeaB. IonescuD. Ionescu
  • Computer Science
    2018 IEEE 12th International Symposium on Applied Computational Intelligence and Informatics (SACI)
  • 2018
The processes involved in the client-server interactions of OT are modeled as real-time systems using Finite State Machine (FSM) theory and the approach is shown to be helpful for organizing and managing the complex distributed aspects of such algorithms.
...

References

SHOWING 1-10 OF 34 REFERENCES

Operation context and context-based operational transformation

The theory of operation context and the COT (Context-based OT) algorithm, a new theoretical framework for better understanding and resolving OT problems, reducing its complexity, and supporting its continual evolution are reported.

An Approach to Ensuring Consistency in Peer-to-Peer Real-Time Group Editors

  • Du LiRui Li
  • Computer Science
    Computer Supported Cooperative Work (CSCW)
  • 2005
SDT is the first and the only OT algorithm proved to converge in peer-to-peer group editors and is based on a novel consistency model that is more explicitly formulated than previously established models for proving correctness.

A New Operational Transformation Framework for Real-Time Group Editors

  • Rui LiDu Li
  • Computer Science
    IEEE Transactions on Parallel and Distributed Systems
  • 2007
This paper analyzes the root of correctness problems in OT and establishes a novel operational transformation framework for developing OT algorithms and proving their correctness.

Proving correctness of transformation functions in collaborative editing systems

This paper shows how a theorem prover can address this serious bottleneck of operational transformation and designs the tombstone transformation functions, which verify TP1 and TP2, preserve intentions and ensure multi-effect relationships.

Tombstone Transformation Functions for Ensuring Consistency in Collaborative Editing Systems

This paper addresses the correctness issue by proposing a new way to model shared state by retaining tombstones when elements are removed and an instantiation of the proposed model for a linear data structure and the related transformation functions are provided.

Preserving operation effects relation in group editors

A novel approach to solving divergence and operation effects relation violation in the same framework is proposed, which preserves the effects relation of concurrent operations so that convergence is achieved automatically.

A framework for undoing actions in collaborative systems

A general framework for implementing undo in collaborative systems is proposed, which allows users to reverse their own changes individually, taking into account the possibility of conflicts between different users' operations that may prevent an undo.

Generalizing operational transformation to the standard general markup language

This paper extends operational transformation to support synchronous collaborative editing of documents written in dialects of SGML such as XML and HTML, based on SGML's abstract data model, the grove, to make synchronous group editing applicable to the modern Web.

Serialization of concurrent operations in a distributed collaborative environment

The principle objective of the this paper is to present an algorithm that overcomes problems of inconsistent copies, a non-respect of user’s intentions, and in the need to undo and redo certain operations.