# Operational transformation

Operational transformation (OT) is a technology for supporting a range of collaboration functionalities in advanced collaborative software systems. OT was originally invented for consistency maintenance and concurrency control in collaborative editing of plain text documents. Its capabilities have been extended and its applications expanded to include group undo, locking, conflict resolution, operation notification and compression, group-awareness, HTML/XML and tree-structured document editing, collaborative office productivity tools, application-sharing, and collaborative computer-aided media design tools. In 2009 OT was adopted as a core technique behind the collaboration features in Apache Wave and Google Docs.

## History

Operational Transformation was pioneered by C. Ellis and S. Gibbs in the GROVE (GRoup Outline Viewing Edit) system in 1989. Several years later, some correctness issues were identified and several approaches were independently proposed to solve these issues, which was followed by another decade of continuous efforts of extending and improving OT by a community of dedicated researchers. In 1998, a Special Interest Group on Collaborative Editing was set up to promote communication and collaboration among CE and OT researchers. Since then, SIGCE holds annual CE workshops in conjunction with major CSCW (Computer Supported Cooperative Work) conferences, such as ACM, CSCW, GROUP and ECSCW.

## System architecture

Collaboration systems utilizing Operational Transformations typically use replicated document storage, where each client has their own copy of the document; clients operate on their local copies in a lock-free, non-blocking manner, and the changes are then propagated to the rest of the clients; this ensures the client high responsiveness in an otherwise high-latency environment such as the Internet. When a client receives the changes propagated from another client, it typically transforms the changes before executing them; the transformation ensures that application-dependent consistency criteria (invariants) are maintained by all sites. This mode of operation results in a system particularly suited for implementing collaboration features, like simultaneous document editing, in a high-latency environment such as the web.

## Basics

The basic idea of OT can be illustrated by using a simple text editing scenario as follows. Given a text document with a string "abc" replicated at two collaborating sites; and two concurrent operations:
* O1 = Insert[0, "x"] (to insert character "x" at position "0")
* O2 = Delete[2, "c"] (to delete the character "c" at position "2")
generated by two users at collaborating sites 1 and 2, respectively. Suppose the two operations are executed in the order of O1 and O2 (at site 1). After executing O1, the document becomes "xabc". To execute O2 after O1, O2 must be transformed against O1 to become: O2' = Delete[3, "c"], whose positional parameter is incremented by one due to the insertion of one character "x" by O1. Executing O2' on "xabc" deletes the correct character "c" and the document becomes "xab". However, if O2 is executed without transformation, it incorrectly deletes character "b" rather than "c". The basic idea of OT is to transform (or adjust) the parameters of an editing operation according to the effects of previously executed concurrent operations so that the transformed operation can achieve the correct effect and maintain document consistency.

## Consistency models

One functionality of OT is to support consistency maintenance in collaborative editing systems. A number of consistency models have been proposed in the research community, some generally for collaborative editing systems, and some specifically for OT algorithms.

### The CC model

In Ellis and Gibbs's 1989 paper "Concurrency control in groupware systems", two consistency properties are required for collaborative editing systems:
* Causality preservation: ensures the execution order of causally dependent operations be the same as their natural cause-effect order during the process of collaboration. The causal relationship between two operations is defined formally by Lamport's "happened-before" relation. When two operations are not causally dependent, they are concurrent. Two concurrent operations can be executed in different order on two different document copies.
* Convergence: ensures the replicated copies of the shared document be identical at all sites at quiescence (i.e., all generated operations have been executed at all sites).
Since concurrent operations may be executed in different orders and editing operations are not commutative in general, copies of the document at different sites may diverge (inconsistent). The first OT algorithm was proposed in Ellis and Gibbs's paper to achieve convergence in a group text editor; the state-vector (or vector clock in classic distributed computing) was used to preserve the precedence property.

### The CCI model

The CCI model was proposed as a consistency management in collaborative editing systems. Under the CCI model, three consistency properties are grouped together:
* Causality preservation : the same as in the CC model.
* Convergence: the same as in the CC model.
* Intention preservation: ensures that the effect of executing an operation on any document state be the same as the intention of the operation. The intention of an operation O is defined as the execution effect which can be achieved by applying O on the document state from which O was generated.
The CCI model extends the CC model with a new criterion: intention preservation. The essential difference between convergence and intention preservation is that the former can always be achieved by a serialization protocol, but the latter may not be achieved by any serialization protocol if operations were always executed in their original forms. Achieving the nonserialisable intention preservation property has been a major technical challenge. OT has been found particularly suitable for achieving convergence and intention preservation in collaborative editing systems.
The CCI model is independent of document types or data models, operation types, or supporting techniques (OT, multi-versioning, serialization, undo/redo). It was not intended for correctness verification for techniques (e.g. OT) that are designed for specific data and operation models and for specific applications. In, the notion of intention preservation was defined and refined at three levels: First, it was defined as a generic consistency requirement for collaborative editing systems; Second, it was defined as operation context-based pre- and post- transformation conditions for generic OT functions; Third, it was defined as specific operation verification criteria to guide the design of OT functions for two primitive operations: string-wise insert and delete, in collaborative plain text editors.

### The CSM model

The condition of intention preservation was not formally specified in the CCI model for purposes of formal proofs. The SDT and LBT approaches try to formalize an alternative conditions that can be proved. The consistency model proposed in these two approaches consist of the following formal conditions:
* Causality: the same definition as in CC model
* Single-operation effects: the effect of executing any operation in any execution state achieves the same effect as in its generation state
* Multi-operation effects: the effects relation of any two operations is maintained after they are both executed in any states

### The CA model

The above CSM model requires that a total order of all objects in the system be specified. Effectively, the specification is reduced to new objects introduced by insert operations. However, specification of the total order entails application-specific policies such as those to break insertion ties (i.e., new objects inserted by two current operations at the same position). Consequently, the total order becomes application specific. Moreover, in the algorithm, the total order must be maintained in the transformation functions and control procedure, which increases time/space complexities of the algorithm.
Alternatively, the CA model is based on the admissibility theory. The CA model includes two aspects:
* Causality: the same definition as in CC model
* Admissibility: The invocation of every operation is admissible in its execution state, i.e., every invocation must not violate any effects relation (object ordering) that has been established by earlier invocations.
These two conditions imply convergence. All cooperating sites converge in a state in which there is a same set of objects that are in the same order. Moreover, the ordering is effectively determined by the effects of the operations when they are generated. Since the two conditions also impose additional constraints on object ordering, they are actually stronger than convergence. The CA model and the design/prove approach are elaborated in the 2005 paper. It no longer requires that a total order of objects be specified in the consistency model and maintained in the algorithm, which hence results in reduced time/space complexities in the algorithm.

## OT system structure

OT is a system of multiple components. One established strategy of designing OT systems is to separate the high-level transformation control (or integration) algorithms from the low-level transformation functions.
* OT Control Algorithms (determine which operations are transformed against others according to their concurrency/context relations)
* OT properties and conditions (divide responsibilities between algorithms and functions)
* OT Transformation Functions (determine how to transform a pair of primitive operations according to operation types, positions, and other parameters)
The transformation control algorithm is concerned with determining:
* Which operation should be transformed against a causally ready new operation
* The order of the transformations
The control algorithm invokes a corresponding set of transformation functions, which determine how to transform one operation against another according to the operation types, positions, and other parameters. The correctness responsibilities of these two layers are formally specified by a set of transformation properties and conditions. Different OT systems with different control algorithms, functions, and communication topologies require maintaining different sets of transformation properties. The separation of an OT system into these two layers allows for the design of generic control algorithms that are applicable to different kinds of application with different data and operation models.
The other alternative approach was proposed in. In their approach, an OT algorithm is correct if it satisfies two formalized correctness criteria:
* Causality preservation
* Admissibility preservation
As long as these two criteria are satisfied, the data replicas converge (with additional constraints) after all operations are executed at all sites. There is no need to enforce a total order of execution for the sake of achieving convergence. Their approach is generally to first identify and prove sufficient conditions for a few transformation functions, and then design a control procedure to ensure those sufficient conditions. This way the control procedure and transformation functions work synergistically to achieve correctness, i.e., causality and admissibility preservation. In their approach, there is no need to satisfy transformation properties such as TP2 because it does not require that the (inclusive) transformation functions work in all possible cases.

## OT data and operation models

There exist two underlying models in each OT system: the data model that defines the way data objects in a document are addressed by operations, and the operation model that defines the set of operations that can be directly transformed by OT functions. Different OT systems may have different data and operation models. For example, the data model of the first OT system is a single linear address space; and its operation model consists of two primitive operations: character-wise insert and delete. The basic operation model has been extended to include a third primitive operation update to support collaborative Word document processing and 3D model editing. The basic OT data model has been extended into a hierarchy of multiple linear addressing domains, which is capable of modeling a broad range of documents. A data adaptation process is often required to map application-specific data models to an OT-compliant data model.
There exist two approaches to supporting application level operations in an OT system:
* Generic operation model approach: which is to devise transformation functions for three primitive operations: insert, delete, and update. This approach needs an operation adaptation process to map application operations to these primitive operations. In this approach, the OT operation model is generic, so transformation functions can be reused for different applications.
* Application-specific operation model approach: which is to devise transformation functions for each pair of application operations. For an application with m different operations, m x m transformation functions are needed for supporting this application. In this approach, transformation functions are application-specific and cannot be reused in different applications.

## OT functions

Various OT functions have been designed for OT systems with different capabilities and used for different applications. OT functions used in different OT systems may be named differently, but they can be classified into two categories:
* Inclusion transformation (or forward transformation): IT(O$_a$, O$_b$) or T(op$_1$,op$_2$), which transforms operation O$_a$ against another operation O$_b$ in such a way that the impact of O$_b$ is effectively included. This is, for example, the case of two insertions at different nodes.
* Exclusion transformation (or backward transformation): ET(O$_a$, O$_b$) or T$^{−1}$(op$_1$,op$_2$), which transforms operation O$_a$ against another operation O$_b$ in such a way that the impact of O$_b$ is effectively excluded. This is, for example, the case of an insertion and a deletion at different nodes
For example, suppose a type String with an operation ins(p, c, sid) where p is the position of insertion, c is the character to insert and sid is the identifier of the site that has generated the operation. We can write the following inclusion transformation function:
We can also write the following exclusion transformation function:
Some OT systems use both IT and ET functions, and some use only IT functions. The complexity of OT function design is determined by various factors:
* the functionality of the OT system: whether the OT system supports do (consistency maintenance), undo, locking, awareness, application sharing, etc.;
* the correctness responsibility in the OT system: what transformation properties (CP1/TP1, CP2/TP2, IP2, IP3, RP) to meet; whether ET is used;
* the operation model of the OT system: whether the OT operation model is generic (e.g. primitive insert, delete, update), or application-specific (all operations of the target application); and
* the data model of the OT system: whether the data in each operation is character-wise (an individual object), string-wise (a sequence of objects), hierarchical, or other structures.

## Transformation properties

Various transformation properties for ensuring OT system correctness have been identified. These properties can be maintained by either the transformation control algorithm or by the transformation functions. Different OT system designs have different division of responsibilities among these components. The specifications of these properties and preconditions of requiring them are given below.

### Convergence properties

The following two properties are related to achieving convergence.
* CP1/TP1: For every pair of concurrent operations $op_{1}$ and $op_{2}$ defined on the same state, the transformation function T satisfies CP1/TP1 property if and only if: $op_{1}\circ T(op_{2},op_{1})\equiv op_{2}\circ T(op_{1},op_{2})$ where $op_{i}\circ op_{j}$ denotes the sequence of operations containing $op_{i}$ followed by $op_{j}$;and where $\equiv$ denotes equivalence of the two sequences of operations. CP1/TP1 precondition: CP1/TP1 is required only if the OT system allows any two operations to be executed in different orders.
* CP2/TP2: For every three concurrent operations $op_{1},op_{2}$ and $op_{3}$ defined on the same document state, the transformation function T satisfies CP2/TP2 property if and only if: $T(op_{3},op_{1}\circ T(op_{2},op_{1}))=T(op_{3},op_{2}\circ T(op_{1},op_{2}))$. CP2/TP2 stipulates equality between two operations transformed with regard to two equivalent sequences of operations: the transformation of $op_{3}$ against the sequence of operation $op_{2}$ followed by $T(op_{1},op_{2})$ must give the same operation as the transformation of $op_{3}$ against the sequence formed by $op_{1}$ and $T(op_{2},op_{1})$. CP2/TP2 precondition: CP2/TP2 is required only if the OT systems allows two operations $op_{1}$ and $op_{2}$ be IT-transformed in two different document states (or contexts).

### Inverse properties

The following three properties are related to achieving the desired group undo effect. They are:
* IP1: Given any document state S and the sequence $op\circ {\overline {op}}$, we have $S\circ op\circ {\overline {op}}=S$, which means the sequence $op\circ {\overline {op}}$ is equivalent to a single identity operation I with respect to the effect on the document state. This property is required in an OT system for achieving the correct undo effect, but is not related to IT functions.
* IP2: The property IP2 expresses that the sequence $op\circ {\overline {op}}$ has no effect on the transformation of other operations. The transformation functions satisfy IP2 if and only if: $T(op_{x},op\circ {\overline {op}})=op_{x}$, which means that the outcome of transforming $op_{x}$ against the sequence $op\circ {\overline {op}}$ is equivalent to the outcome of transforming $op_{x}$ against the identity operation I. IP2 precondition: IP2 is required only if the OT systems allows an operation $op_{x}$ to be transformed against a pair of do and undo operations $op\circ {\overline {op}}$, one-by-one.
* IP3: Given two concurrent operations $op_{1}$ and $op_{2}$ defined on the same document state (or context), if ${\overline {op_{1}}}'=T({\overline {op_{1}}},T(op_{2},op_{1}))$ and ${\overline {op_{1}'}}={\overline {T(op_{1},op_{2})}}$. The transformation functions satisfy the property IP3 if and only if ${\overline {op_{1}}}'={\overline {op_{1}'}}$, which means that the transformed inverse operation ${\overline {op_{1}}}'$ is equal to the inverse of the transformed operation ${\overline {op_{1}'}}$. IP3 precondition: IP3 is required only if the OT system allows an inverse operation ${\overline {op_{1}}}$ to be transformed against an operation $op_{2}$ that is concurrent and defined on the same document state as (or context-equivalent to) $op_{1}$.

## OT control (integration) algorithms

Various OT control algorithms have been designed for OT systems with different capabilities and for different applications. The complexity of OT control algorithm design is determined by multiple factors. A key differentiating factor is whether an algorithm is capable of supporting concurrency control (do) and/or group undo. In addition, different OT control algorithm designs make different tradeoffs in:
* assigning correctness responsibilities among the control algorithm and transformation functions, and
* time-space complexity of the OT system.
Most existing OT control algorithms for concurrency control adopt the theory of causality/concurrency as the theoretical basis: causally related operations must be executed in their causal order; concurrent operations must be transformed before their execution. However, it was well known that concurrency condition alone cannot capture all OT transformation conditions. In a recent work, the theory of operation context has been proposed to explicitly represent the notion of a document state, which can be used to formally express OT transformation conditions for supporting the design and verification of OT control algorithms.
The following table gives an overview of some existing OT control/integration algorithms
| OT control/integration algorithms (systems) | Required transformation function types | Support OT-based Do? | Support OT-based Undo? | Transformation properties supported by control algorithm | Transformation properties supported by transformation functions | Transformation ordering and propagation constraints | Timestamp |
| dOPT (GROVE) | T (IT) | Yes | No | None | CP1/TP1, CP2/TP2 | Causal order | State vector |
| selective-undo (DistEdit) | Transpose (IT and ET) | No | Selective Undo | N/A | CP1/TP1, CP2/TP2, RP, IP1, IP2, IP3 | Causal order | ? |
| adOPTed (JOINT EMACS) | LTransformation (IT) | Yes | Chronological Undo | IP2, IP3 | CP1/TP1, CP2/TP2, IP1 | Causal order | State vector |
| Jupiter | xform (IT) | Yes | No | CP2/TP2 | CP1/TP1 | Causal order + Central transformation server | Scalar |
| Google Wave OT | transform and composition(IT) | Yes | No | CP2/TP2 | CP1/TP1 | Causal order + Central transformation server + stop'n'wait propagation protocol | Scalar |
| GOT (REDUCE) | IT and ET | Yes | No | CP1/TP1, CP2/TP2 | None | Causal order + Discontinuous total order | State vector |
| GOTO (REDUCE, CoWord, CoPPT, CoMaya) | IT and ET | Yes | No | None | CP1/TP1, CP2/TP2 | Causal order | State vector |
| AnyUndo (REDUCE, CoWord, CoPPT, CoMaya) | IT and ET | No | Undo any operation | IP2, IP3, RP | IP1, CP1/TP1, CP2/TP2 | Causal order | State vector |
| SCOP (NICE) | IT | Yes | No | CP2/TP2 | CP1/TP1 | Causal order + Central transformation server | Scalar |
| COT (REDUCE, CoWord, CoPPT, CoMaya) | IT | Yes | Undo any operation | CP2/TP2, IP2, IP3 | CP1/TP1, (no ET therefore no IP1 necessary) | Causal order + Discontinuous total order | Context vector |
| TIBOT | IT | Yes | No | CP2/TP2 | CP1/TP1 | Causal order | Scalar |
| SOCT4 | Forward transformation (IT) | Yes | No | CP2/TP2 | CP1/TP1 | Causal order + Continuous total order | Scalar |
| SOCT2 | Forward Transformation(IT) and Backward Transformation(ET) | Yes | No | None | CP1/TP1, CP2/TP2, RP | Causal order | State vector |
| MOT2 | Forward transformation (IT) | Yes | No | ? | CP1/TP1, CP2/TP2 | ? | scalar |
   A continuous total order is a strict total order where it is possible to detect a missing element i.e. 1,2,3,4,... is a continuous total order, 1,2,3,5,... is not a continuous total order.
The transformation-based algorithms proposed in are based on the alternative consistency models "CSM" and "CA" as described above. Their approaches differ from those listed in the table. They use vector timestamps for causality preservation. The other correctness conditions are "single-"/"multi-" operation effects relation preservation or "admissibility" preservation. Those conditions are ensured by the control procedure and transformation functions synergistically. There is no need to discuss TP1/TP2 in their work. Hence they are not listed in the above table.
There exist some other optimistic consistency control algorithms that seek alternative ways to design transformation algorithms, but do not fit well with the above taxonomy and characterization. For example, Mark and Retrace
The correctness problems of OT led to introduction of transformationless post-OT schemes, such as WOOT, Logoot and Causal Trees (CT). "Post-OT" schemes decompose the document into atomic operations, but they workaround the need to transform operations by employing a combination of unique symbol identifiers, vector timestamps and/or tombstones.

## Critique of OT

While the classic OT approach of defining operations through their offsets in the text seems to be simple and natural, real-world distributed systems raise serious issues. Namely, that operations propagate with finite speed, states of participants are often different, thus the resulting combinations of states and operations are extremely hard to foresee and understand. As Li and Li put it, "Due to the need to consider complicated case coverage, formal proofs are very complicated and error-prone, even for OT algorithms that only treat two characterwise primitives (insert and delete)".
Similarly, Joseph Gentle who is a former Google Wave engineer and an author of the Share.JS library wrote, "Unfortunately, implementing OT sucks. There's a million algorithms with different tradeoffs, mostly trapped in academic papers. […] Wave took 2 years to write and if we rewrote it today, it would take almost as long to write a second time." But later he amends his comment with "I no longer believe that wave would take 2 years to implement now - mostly because of advances in web frameworks and web browsers."
For OT to work, every single change to the data needs to be captured: "Obtaining a snapshot of the state is usually trivial, but capturing edits is a different matter altogether. […] The richness of modern user interfaces can make this problematic, especially within a browser-based environment." An alternative to OT is differential synchronization.
Another alternative to OT is using sequence types of conflict-free replicated data type.