Channel system (computer science): Difference between revisions

Revision as of 22:35, 15 October 2019

Revision as of 17:55, 1 December 2019

Line 60:

A lossy channel system admits two kinds of steps. Perfect steps, as defined above, and lossy step. We denote a lossy step, <math>(q,w_1,\dots,w_i\cdot a\cdot w'_i\dots,,w_m)\rightsquigarrow(q,w_1,\dots,w_i\cdot w'_i,w'_m)</math>.

It should be noted that aA run in which channel are emptied as soon as messages are sent into them is a valid run according to this definition. For this reason, some fairness conditions may be introduced to those systems.

==== Channel fairness ====