# Theory of Competition Exercise – Computer Science Stack Exchange

I learned my studies on competition theory and we had this exercise. Anyone could help me, how can I solve this problem?

1. Construct two distributed calculations

$$C_ {1} = ((E_ {1}, prec _ {1}), …, (E_ {n}, prec _ {n}), Gamma_ {1}, C_ {2} = ( (E_ {1}, prec _ {1}), …, (E_ {n}, prec _ {n}), Gamma_ {2})$$

constrained with the same trace for which they have the same vector clock.

$$E = bigcup_ {i = 1} ^ {n} E_ {1}$$

2. Find distributed computing:
$$C_ {1} = ((E_ {1}, prec _ {1}), …, (E_ {n}, prec _ {n}), Gamma); Gamma is CO$$

stretched with the same trace and its set of vector clock punches.

Thank you so much,