Next: Partially Ordered Runs Up: Sequential Runs Previous: Stages

Quasi-sequential Runs

An obvious generalization of a sequential run is a quasi-sequential run [ S_n : n < kappa ] , where each S_{n+1} is obtained from Sn by firing a collection An of agents. We do not mean that An is a team; since teams are agents, the definition of sequential runs does not exclude team moves. We mean that each a in An makes a move at Sn . If all agents are deterministic, then S_{n+1} is the result of firing union {Updates(S,a): a in An} .

Quasi-sequential runs may arise, for example, if you order moves in real (physical) time.


huggins@acm.org
Thu Mar 23 17:30:35 EST 1995