Concurrent undo operations in collaborative environments using operational transformation

17Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In distributed collaborative systems, replicated objects, shared by users, are subject to concurrency constraints. All methods [4, 13, 18, 15,16, 19, 22] proposed to serialize concurrent operations and achieve copies convergence of replicated objects are based on the use of Operational Transformations. In this context, giving the user the ability to undo an operation has been recognized as a difficult problem [1, 2, 3, 12, 14, 20, 21]. The few general propositions to solve the problem sometimes compromise copies convergence and/or users' intention, insofar as the Operational Transformations used are unsuitable for undo. This paper has a twofold objective. Firstly, it aims to highlight two general conditions (named C3 and C4) that need to be satisfied by any transformation adapted to undo. Secondly, it presents a general undo algorithm based on the definition of a generic undo-fitted transformation, which automatically verifies these conditions. The interest of the proposed method is that the undoing of an operation obeys to the same processing as the one used for regular operations in collaborative systems such as [15,19]. Distributed collaborative systems, copies consistency, operational transformations, concurrent undo © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Ferrié, J., Vidot, N., & Cart, M. (2004). Concurrent undo operations in collaborative environments using operational transformation. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3290, 155–173. https://doi.org/10.1007/978-3-540-30468-5_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free