Presentation is loading. Please wait.

Presentation is loading. Please wait.

Tree Edit Protocol Specification Maaike Gerritsen Peter van Dijk Robert Stremler.

Similar presentations


Presentation on theme: "Tree Edit Protocol Specification Maaike Gerritsen Peter van Dijk Robert Stremler."— Presentation transcript:

1 Tree Edit Protocol Specification Maaike Gerritsen Peter van Dijk Robert Stremler

2 Explanation of the Protocol Different people want to edit nodes in a tree When a node is edited then other users cannot edit this node to prevent conflicts

3 Protocol Requirements When a node is locked its children are locked too. Parent nodes should have a special lock Siblings of locked node can be edited Nodes should have a time limit on their locks

4 Formal Specification data Tree a = Leaf State a | Node a State [Tree a] type State = Free | Locked | SoftLocked hardLock :: Tree a → Bool softLock :: Tree a → Bool childeren :: Tree a → [Tree a] parent :: Tree a → Tree a isSoftLocked :: Tree a → Bool isHardLocked :: Tree a → Bool isLocked :: Tree a → Bool release :: Tree a → Bool

5 Predicates that always hold

6 Temporal Properties isLocked n → [] <> ¬ (isLocked n) atomicity: all locks and releases should be atomic


Download ppt "Tree Edit Protocol Specification Maaike Gerritsen Peter van Dijk Robert Stremler."

Similar presentations


Ads by Google