Peterson算法 ins idel, inside: boolean. turn: integer tur n nsi de1 : false /*P1不在其临界区内*/ inside:= false /*P2不在其临界区内*/ process P1 process P2 begin begin inside . true inside:= true turn 2 turn while(ins ide2 and turn=2) while (ins ide1 and turn=1) do begin end do begin end; 临界区; 临界区; inside false: inside false: end: end:Peterson算法 inside1,inside2:boolean; turn:integer; turn := 1; inside1 := false; /* P1 不在其临界区内 */ inside2 := false; /* P2 不在其临界区内 */ process P1 begin inside1 := true； turn := 2； while (inside2 and turn=2) do begin end； 临界区; inside1 := false； end; p rocess P2 begin inside2 := true； turn := 1； while (inside1 and turn=1) do begin end； 临界区; inside2 := false； end;