-
Notifications
You must be signed in to change notification settings - Fork 201
/
Copy pathMultiPaxos.tla
585 lines (508 loc) · 26.8 KB
/
MultiPaxos.tla
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
(**********************************************************************************)
(* MultiPaxos in state machine replication (SMR) style with write/read commands *)
(* on a single key. Please refer to the detailed comments in PlusCal code to see *)
(* how this spec closely models a practical SMR log replication system. *)
(* *)
(* Network is modeled as a monotonic set of sent messages. This is a particularly *)
(* efficient model for a practical non-Byzantine asynchronous network: messages *)
(* may be arbitrarily delayed, may be duplicatedly received, and may be lost (but *)
(* in this case the sender would repeatedly retry and thus the message should *)
(* eventually gets received). *)
(* *)
(* Linearizability is checked from global client's point of view on the sequence *)
(* of client observed request/acknowledgement events after termination. *)
(* *)
(* Liveness is checked by not having deadlocks till observation of all requests. *)
(* *)
(* Possible further extensions include node failure injection, leader lease and *)
(* local read mechanism, etc. *)
(**********************************************************************************)
---- MODULE MultiPaxos ----
EXTENDS FiniteSets, Sequences, Integers, TLC
(*******************************)
(* Model inputs & assumptions. *)
(*******************************)
CONSTANT Replicas, \* symmetric set of server nodes
Writes, \* symmetric set of write commands (each w/ unique value)
Reads, \* symmetric set of read commands
MaxBallot \* maximum ballot pickable for leader preemption
ReplicasAssumption == /\ IsFiniteSet(Replicas)
/\ Cardinality(Replicas) >= 1
WritesAssumption == /\ IsFiniteSet(Writes)
/\ Cardinality(Writes) >= 1
/\ "nil" \notin Writes
\* a write command model value serves as both the
\* ID of the command and the value to be written
ReadsAssumption == /\ IsFiniteSet(Reads)
/\ Cardinality(Reads) >= 0
/\ "nil" \notin Writes
MaxBallotAssumption == /\ MaxBallot \in Nat
/\ MaxBallot >= 2
ASSUME /\ ReplicasAssumption
/\ WritesAssumption
/\ ReadsAssumption
/\ MaxBallotAssumption
----------
(********************************)
(* Useful constants & typedefs. *)
(********************************)
Commands == Writes \cup Reads
NumCommands == Cardinality(Commands)
Range(seq) == {seq[i]: i \in 1..Len(seq)}
\* Client observable events.
ClientEvents == [type: {"Req"}, cmd: Commands]
\cup [type: {"Ack"}, cmd: Commands,
val: {"nil"} \cup Writes]
ReqEvent(c) == [type |-> "Req", cmd |-> c]
AckEvent(c, v) == [type |-> "Ack", cmd |-> c, val |-> v]
\* val is the old value for a write command
InitPending == (CHOOSE ws \in [1..Cardinality(Writes) -> Writes]
: Range(ws) = Writes)
\o (CHOOSE rs \in [1..Cardinality(Reads) -> Reads]
: Range(rs) = Reads)
\* W.L.O.G., choose any sequence contatenating writes
\* commands and read commands as the sequence of reqs;
\* all other cases are either symmetric or less useful
\* than this one
\* Server-side constants & states.
MajorityNum == (Cardinality(Replicas) \div 2) + 1
Ballots == 1..MaxBallot
Slots == 1..NumCommands
Statuses == {"Preparing", "Accepting", "Committed"}
InstStates == [status: {"Empty"} \cup Statuses,
cmd: {"nil"} \cup Commands,
voted: [bal: {0} \cup Ballots,
cmd: {"nil"} \cup Commands]]
NullInst == [status |-> "Empty",
cmd |-> "nil",
voted |-> [bal |-> 0, cmd |-> "nil"]]
NodeStates == [leader: {"none"} \cup Replicas,
kvalue: {"nil"} \cup Writes,
commitUpTo: {0} \cup Slots,
balPrepared: {0} \cup Ballots,
balMaxKnown: {0} \cup Ballots,
insts: [Slots -> InstStates]]
NullNode == [leader |-> "none",
kvalue |-> "nil",
commitUpTo |-> 0,
balPrepared |-> 0,
balMaxKnown |-> 0,
insts |-> [s \in Slots |-> NullInst]]
FirstEmptySlot(insts) ==
CHOOSE s \in Slots:
/\ insts[s].status = "Empty"
/\ \A t \in 1..(s-1): insts[t].status # "Empty"
\* Service-internal messages.
PrepareMsgs == [type: {"Prepare"}, src: Replicas,
bal: Ballots]
PrepareMsg(r, b) == [type |-> "Prepare", src |-> r,
bal |-> b]
InstsVotes == [Slots -> [bal: {0} \cup Ballots,
cmd: {"nil"} \cup Commands]]
VotesByNode(n) == [s \in Slots |-> n.insts[s].voted]
PrepareReplyMsgs == [type: {"PrepareReply"}, src: Replicas,
bal: Ballots,
votes: InstsVotes]
PrepareReplyMsg(r, b, iv) ==
[type |-> "PrepareReply", src |-> r,
bal |-> b,
votes |-> iv]
PeakVotedCmd(prs, s) ==
IF \A pr \in prs: pr.votes[s].bal = 0
THEN "nil"
ELSE LET bc == CHOOSE bc \in (Ballots \X Commands):
/\ \E pr \in prs: /\ pr.votes[s].bal = bc[1]
/\ pr.votes[s].cmd = bc[2]
/\ \A pr \in prs: pr.votes[s].bal =< bc[1]
IN bc[2]
AcceptMsgs == [type: {"Accept"}, src: Replicas,
bal: Ballots,
slot: Slots,
cmd: Commands]
AcceptMsg(r, b, s, c) == [type |-> "Accept", src |-> r,
bal |-> b,
slot |-> s,
cmd |-> c]
AcceptReplyMsgs == [type: {"AcceptReply"}, src: Replicas,
bal: Ballots,
slot: Slots]
AcceptReplyMsg(r, b, s) == [type |-> "AcceptReply", src |-> r,
bal |-> b,
slot |-> s]
CommitNoticeMsgs == [type: {"CommitNotice"}, upto: Slots]
CommitNoticeMsg(u) == [type |-> "CommitNotice", upto |-> u]
Messages == PrepareMsgs
\cup PrepareReplyMsgs
\cup AcceptMsgs
\cup AcceptReplyMsgs
\cup CommitNoticeMsgs
----------
(******************************)
(* Main algorithm in PlusCal. *)
(******************************)
(*--algorithm MultiPaxos
variable msgs = {}, \* messages in the network
node = [r \in Replicas |-> NullNode], \* replica node state
pending = InitPending, \* sequence of pending reqs
observed = <<>>; \* client observed events
define
UnseenPending(insts) ==
LET filter(c) == c \notin {insts[s].cmd: s \in Slots}
IN SelectSeq(pending, filter)
RemovePending(cmd) ==
LET filter(c) == c # cmd
IN SelectSeq(pending, filter)
reqsMade == {e.cmd: e \in {e \in Range(observed): e.type = "Req"}}
acksRecv == {e.cmd: e \in {e \in Range(observed): e.type = "Ack"}}
terminated == /\ Len(pending) = 0
/\ Cardinality(reqsMade) = NumCommands
/\ Cardinality(acksRecv) = NumCommands
end define;
\* Send a set of messages helper.
macro Send(set) begin
msgs := msgs \cup set;
end macro;
\* Observe a client event helper.
macro Observe(e) begin
if e \notin Range(observed) then
observed := Append(observed, e);
end if;
end macro;
\* Resolve a pending command helper.
macro Resolve(c) begin
pending := RemovePending(c);
end macro;
\* Someone steps up as leader and sends Prepare message to followers.
macro BecomeLeader(r) begin
\* if I'm not a leader
await node[r].leader # r;
\* pick a greater ballot number
with b \in Ballots do
await /\ b > node[r].balMaxKnown
/\ ~\E m \in msgs: (m.type = "Prepare") /\ (m.bal = b);
\* W.L.O.G., using this clause to model that ballot
\* numbers from different proposers be unique
\* update states and restart Prepare phase for in-progress instances
node[r].leader := r ||
node[r].balPrepared := 0 ||
node[r].balMaxKnown := b ||
node[r].insts :=
[s \in Slots |->
[node[r].insts[s]
EXCEPT !.status = IF @ = "Accepting"
THEN "Preparing"
ELSE @]];
\* broadcast Prepare and reply to myself instantly
Send({PrepareMsg(r, b),
PrepareReplyMsg(r, b, VotesByNode(node[r]))});
end with;
end macro;
\* Replica replies to a Prepare message.
macro HandlePrepare(r) begin
\* if receiving a Prepare message with larger ballot than ever seen
with m \in msgs do
await /\ m.type = "Prepare"
/\ m.bal > node[r].balMaxKnown;
\* update states and reset statuses
node[r].leader := m.src ||
node[r].balMaxKnown := m.bal ||
node[r].insts :=
[s \in Slots |->
[node[r].insts[s]
EXCEPT !.status = IF @ = "Accepting"
THEN "Preparing"
ELSE @]];
\* send back PrepareReply with my voted list
Send({PrepareReplyMsg(r, m.bal, VotesByNode(node[r]))});
end with;
end macro;
\* Leader gathers PrepareReply messages until condition met, then marks
\* the corresponding ballot as prepared and saves highest voted commands.
macro HandlePrepareReplies(r) begin
\* if I'm waiting for PrepareReplies
await /\ node[r].leader = r
/\ node[r].balPrepared = 0;
\* when there are enough number of PrepareReplies of desired ballot
with prs = {m \in msgs: /\ m.type = "PrepareReply"
/\ m.bal = node[r].balMaxKnown}
do
await Cardinality(prs) >= MajorityNum;
\* marks this ballot as prepared and saves highest voted command
\* in each slot if any
node[r].balPrepared := node[r].balMaxKnown ||
node[r].insts :=
[s \in Slots |->
[node[r].insts[s]
EXCEPT !.status = IF \/ @ = "Preparing"
\/ /\ @ = "Empty"
/\ PeakVotedCmd(prs, s) # "nil"
THEN "Accepting"
ELSE @,
!.cmd = PeakVotedCmd(prs, s)]];
\* send Accept messages for in-progress instances
Send({AcceptMsg(r, node[r].balPrepared, s, node[r].insts[s].cmd):
s \in {s \in Slots: node[r].insts[s].status = "Accepting"}});
end with;
end macro;
\* A prepared leader takes a new request to fill the next empty slot.
macro TakeNewRequest(r) begin
\* if I'm a prepared leader and there's pending request
await /\ node[r].leader = r
/\ node[r].balPrepared = node[r].balMaxKnown
/\ \E s \in Slots: node[r].insts[s].status = "Empty"
/\ Len(UnseenPending(node[r].insts)) > 0;
\* find the next empty slot and pick a pending request
with s = FirstEmptySlot(node[r].insts),
c = Head(UnseenPending(node[r].insts))
\* W.L.O.G., only pick a command not seen in current
\* prepared log to have smaller state space; in practice,
\* duplicated client requests should be treated by some
\* idempotency mechanism such as using request IDs
do
\* update slot status and voted
node[r].insts[s].status := "Accepting" ||
node[r].insts[s].cmd := c ||
node[r].insts[s].voted.bal := node[r].balPrepared ||
node[r].insts[s].voted.cmd := c;
\* broadcast Accept and reply to myself instantly
Send({AcceptMsg(r, node[r].balPrepared, s, c),
AcceptReplyMsg(r, node[r].balPrepared, s)});
\* append to observed events sequence if haven't yet
Observe(ReqEvent(c));
end with;
end macro;
\* Replica replies to an Accept message.
macro HandleAccept(r) begin
\* if receiving an unreplied Accept message with valid ballot
with m \in msgs do
await /\ m.type = "Accept"
/\ m.bal >= node[r].balMaxKnown
/\ m.bal > node[r].insts[m.slot].voted.bal;
\* update node states and corresponding instance's states
node[r].leader := m.src ||
node[r].balMaxKnown := m.bal ||
node[r].insts[m.slot].status := "Accepting" ||
node[r].insts[m.slot].cmd := m.cmd ||
node[r].insts[m.slot].voted.bal := m.bal ||
node[r].insts[m.slot].voted.cmd := m.cmd;
\* send back AcceptReply
Send({AcceptReplyMsg(r, m.bal, m.slot)});
end with;
end macro;
\* Leader gathers AcceptReply messages for a slot until condition met, then
\* marks the slot as committed and acknowledges the client.
macro HandleAcceptReplies(r) begin
\* if I think I'm a current leader
await /\ node[r].leader = r
/\ node[r].balPrepared = node[r].balMaxKnown
/\ node[r].commitUpTo < NumCommands
/\ node[r].insts[node[r].commitUpTo+1].status = "Accepting";
\* W.L.O.G., only enabling the next slot after commitUpTo
\* here to make the body of this macro simpler
\* for this slot, when there are enough number of AcceptReplies
with s = node[r].commitUpTo + 1,
c = node[r].insts[s].cmd,
v = node[r].kvalue,
ars = {m \in msgs: /\ m.type = "AcceptReply"
/\ m.slot = s
/\ m.bal = node[r].balPrepared}
do
await Cardinality(ars) >= MajorityNum;
\* marks this slot as committed and apply command
node[r].insts[s].status := "Committed" ||
node[r].commitUpTo := s ||
node[r].kvalue := IF c \in Writes THEN c ELSE @;
\* append to observed events sequence if haven't yet, and remove
\* the command from pending
Observe(AckEvent(c, v));
Resolve(c);
\* broadcast CommitNotice to followers
Send({CommitNoticeMsg(s)});
end with;
end macro;
\* Replica receives new commit notification.
macro HandleCommitNotice(r) begin
\* if I'm a follower waiting on CommitNotice
await /\ node[r].leader # r
/\ node[r].commitUpTo < NumCommands
/\ node[r].insts[node[r].commitUpTo+1].status = "Accepting";
\* W.L.O.G., only enabling the next slot after commitUpTo
\* here to make the body of this macro simpler
\* for this slot, when there's a CommitNotice message
with s = node[r].commitUpTo + 1,
c = node[r].insts[s].cmd,
m \in msgs
do
await /\ m.type = "CommitNotice"
/\ m.upto = s;
\* marks this slot as committed and apply command
node[r].insts[s].status := "Committed" ||
node[r].commitUpTo := s ||
node[r].kvalue := IF c \in Writes THEN c ELSE @;
end with;
end macro;
\* Replica server node main loop.
process Replica \in Replicas
begin
rloop: while ~terminated do
either
BecomeLeader(self);
or
HandlePrepare(self);
or
HandlePrepareReplies(self);
or
TakeNewRequest(self);
or
HandleAccept(self);
or
HandleAcceptReplies(self);
or
HandleCommitNotice(self);
end either;
end while;
end process;
end algorithm; *)
----------
\* BEGIN TRANSLATION (chksum(pcal) = "2be53042" /\ chksum(tla) = "bfbfd945")
VARIABLES msgs, node, pending, observed, pc
(* define statement *)
UnseenPending(insts) ==
LET filter(c) == c \notin {insts[s].cmd: s \in Slots}
IN SelectSeq(pending, filter)
RemovePending(cmd) ==
LET filter(c) == c # cmd
IN SelectSeq(pending, filter)
reqsMade == {e.cmd: e \in {e \in Range(observed): e.type = "Req"}}
acksRecv == {e.cmd: e \in {e \in Range(observed): e.type = "Ack"}}
terminated == /\ Len(pending) = 0
/\ Cardinality(reqsMade) = NumCommands
/\ Cardinality(acksRecv) = NumCommands
vars == << msgs, node, pending, observed, pc >>
ProcSet == (Replicas)
Init == (* Global variables *)
/\ msgs = {}
/\ node = [r \in Replicas |-> NullNode]
/\ pending = InitPending
/\ observed = <<>>
/\ pc = [self \in ProcSet |-> "rloop"]
rloop(self) == /\ pc[self] = "rloop"
/\ IF ~terminated
THEN /\ \/ /\ node[self].leader # self
/\ \E b \in Ballots:
/\ /\ b > node[self].balMaxKnown
/\ ~\E m \in msgs: (m.type = "Prepare") /\ (m.bal = b)
/\ node' = [node EXCEPT ![self].leader = self,
![self].balPrepared = 0,
![self].balMaxKnown = b,
![self].insts = [s \in Slots |->
[node[self].insts[s]
EXCEPT !.status = IF @ = "Accepting"
THEN "Preparing"
ELSE @]]]
/\ msgs' = (msgs \cup ({PrepareMsg(self, b),
PrepareReplyMsg(self, b, VotesByNode(node'[self]))}))
/\ UNCHANGED <<pending, observed>>
\/ /\ \E m \in msgs:
/\ /\ m.type = "Prepare"
/\ m.bal > node[self].balMaxKnown
/\ node' = [node EXCEPT ![self].leader = m.src,
![self].balMaxKnown = m.bal,
![self].insts = [s \in Slots |->
[node[self].insts[s]
EXCEPT !.status = IF @ = "Accepting"
THEN "Preparing"
ELSE @]]]
/\ msgs' = (msgs \cup ({PrepareReplyMsg(self, m.bal, VotesByNode(node'[self]))}))
/\ UNCHANGED <<pending, observed>>
\/ /\ /\ node[self].leader = self
/\ node[self].balPrepared = 0
/\ LET prs == {m \in msgs: /\ m.type = "PrepareReply"
/\ m.bal = node[self].balMaxKnown} IN
/\ Cardinality(prs) >= MajorityNum
/\ node' = [node EXCEPT ![self].balPrepared = node[self].balMaxKnown,
![self].insts = [s \in Slots |->
[node[self].insts[s]
EXCEPT !.status = IF \/ @ = "Preparing"
\/ /\ @ = "Empty"
/\ PeakVotedCmd(prs, s) # "nil"
THEN "Accepting"
ELSE @,
!.cmd = PeakVotedCmd(prs, s)]]]
/\ msgs' = (msgs \cup ({AcceptMsg(self, node'[self].balPrepared, s, node'[self].insts[s].cmd):
s \in {s \in Slots: node'[self].insts[s].status = "Accepting"}}))
/\ UNCHANGED <<pending, observed>>
\/ /\ /\ node[self].leader = self
/\ node[self].balPrepared = node[self].balMaxKnown
/\ \E s \in Slots: node[self].insts[s].status = "Empty"
/\ Len(UnseenPending(node[self].insts)) > 0
/\ LET s == FirstEmptySlot(node[self].insts) IN
LET c == Head(UnseenPending(node[self].insts)) IN
/\ node' = [node EXCEPT ![self].insts[s].status = "Accepting",
![self].insts[s].cmd = c,
![self].insts[s].voted.bal = node[self].balPrepared,
![self].insts[s].voted.cmd = c]
/\ msgs' = (msgs \cup ({AcceptMsg(self, node'[self].balPrepared, s, c),
AcceptReplyMsg(self, node'[self].balPrepared, s)}))
/\ IF (ReqEvent(c)) \notin Range(observed)
THEN /\ observed' = Append(observed, (ReqEvent(c)))
ELSE /\ TRUE
/\ UNCHANGED observed
/\ UNCHANGED pending
\/ /\ \E m \in msgs:
/\ /\ m.type = "Accept"
/\ m.bal >= node[self].balMaxKnown
/\ m.bal > node[self].insts[m.slot].voted.bal
/\ node' = [node EXCEPT ![self].leader = m.src,
![self].balMaxKnown = m.bal,
![self].insts[m.slot].status = "Accepting",
![self].insts[m.slot].cmd = m.cmd,
![self].insts[m.slot].voted.bal = m.bal,
![self].insts[m.slot].voted.cmd = m.cmd]
/\ msgs' = (msgs \cup ({AcceptReplyMsg(self, m.bal, m.slot)}))
/\ UNCHANGED <<pending, observed>>
\/ /\ /\ node[self].leader = self
/\ node[self].balPrepared = node[self].balMaxKnown
/\ node[self].commitUpTo < NumCommands
/\ node[self].insts[node[self].commitUpTo+1].status = "Accepting"
/\ LET s == node[self].commitUpTo + 1 IN
LET c == node[self].insts[s].cmd IN
LET v == node[self].kvalue IN
LET ars == {m \in msgs: /\ m.type = "AcceptReply"
/\ m.slot = s
/\ m.bal = node[self].balPrepared} IN
/\ Cardinality(ars) >= MajorityNum
/\ node' = [node EXCEPT ![self].insts[s].status = "Committed",
![self].commitUpTo = s,
![self].kvalue = IF c \in Writes THEN c ELSE @]
/\ IF (AckEvent(c, v)) \notin Range(observed)
THEN /\ observed' = Append(observed, (AckEvent(c, v)))
ELSE /\ TRUE
/\ UNCHANGED observed
/\ pending' = RemovePending(c)
/\ msgs' = (msgs \cup ({CommitNoticeMsg(s)}))
\/ /\ /\ node[self].leader # self
/\ node[self].commitUpTo < NumCommands
/\ node[self].insts[node[self].commitUpTo+1].status = "Accepting"
/\ LET s == node[self].commitUpTo + 1 IN
LET c == node[self].insts[s].cmd IN
\E m \in msgs:
/\ /\ m.type = "CommitNotice"
/\ m.upto = s
/\ node' = [node EXCEPT ![self].insts[s].status = "Committed",
![self].commitUpTo = s,
![self].kvalue = IF c \in Writes THEN c ELSE @]
/\ UNCHANGED <<msgs, pending, observed>>
/\ pc' = [pc EXCEPT ![self] = "rloop"]
ELSE /\ pc' = [pc EXCEPT ![self] = "Done"]
/\ UNCHANGED << msgs, node, pending, observed >>
Replica(self) == rloop(self)
(* Allow infinite stuttering to prevent deadlock on termination. *)
Terminating == /\ \A self \in ProcSet: pc[self] = "Done"
/\ UNCHANGED vars
Next == (\E self \in Replicas: Replica(self))
\/ Terminating
Spec == Init /\ [][Next]_vars
Termination == <>(\A self \in ProcSet: pc[self] = "Done")
\* END TRANSLATION
====