Sequential execution is enforced. 3. Solved Exercise 2: Concurrency (Fork) Problem: After an initialization, two independent tasks (Task X and Task Y) run in parallel.
P1 → T1 → P2 → T2 → P4 ↘ ↘ P3 → T3 → P5 → T4 T1 fires → tokens in P2 and P3 → T2 and T3 can fire independently (in any order or simultaneously). 4. Solved Exercise 3: Mutual Exclusion (Shared Resource) Problem: Two processes (P1, P2) share a single printer. Only one can print at a time.
Initial marking: ( M_0 = (1,1,0,0) )
Sequential execution is enforced. 3. Solved Exercise 2: Concurrency (Fork) Problem: After an initialization, two independent tasks (Task X and Task Y) run in parallel.
P1 → T1 → P2 → T2 → P4 ↘ ↘ P3 → T3 → P5 → T4 T1 fires → tokens in P2 and P3 → T2 and T3 can fire independently (in any order or simultaneously). 4. Solved Exercise 3: Mutual Exclusion (Shared Resource) Problem: Two processes (P1, P2) share a single printer. Only one can print at a time. redes de petri ejercicios resueltos
Initial marking: ( M_0 = (1,1,0,0) )