Author(s)

Maurice Tchoupé Tchendji¹, Rodrigue D. Djeumen², Marcellin T. Atemkeng³

¹Department of Mathematics and Computer Science, Faculty of Sciences, University of Dschang, Dschang, Cameroon.
²Department of Mathematics and Computer Science, Faculty of Sciences, University of Douala, Douala, Cameroon.
³Department of Physics and Electronics, Rhodes University, Grahamstown, South Africa.

Complex structured documents can be intentionally represented as a tree structure decorated with attributes. Ignoring attributes (these are related to semantic aspects that can be treated separately from purely structural aspects which interest us here), in the context of a cooperative edition, legal structures are characterized by a document model (an abstract grammar) and each intentional representation can be manipulated independently and eventually asynchronously by several co-authors through various editing tools that operate on its “partial replicas”. For unsynchronized edition of a partial replica, considered co-author must have a syntactic document local model that constraints him to ensure minimum consistency of local representation that handles with respect to the global model. This consistency is synonymous with the existence of one or more (global) intentional representations towards the global model, assuming the current local representation as her/their partial replica. The purpose of this paper is to present the grammatical structures which are grammars that permit not only to specify a (global) model for documents published in a cooperative manner, but also to derive automatically via a so call projection operation, consistent (local) models for each co-authors involved in the cooperative edition. We also show some properties that meet these grammatical structures.

Structured Documents, Documents Models, Grammars, Cooperative Edition, Structured Edition, Projections, Views, Partial Replicas

Tchendji, M. , Djeumen, R. and Atemkeng, M. (2017) A Stable and Consistent Document Model Suitable for Asynchronous Cooperative Edition. Journal of Computer and Communications, 5, 69-82. doi: 10.4236/jcc.2017.58006.