Algorithme de Dekker

PROCEDURE dekker_s_algorithm IS
	TYPE process_enumeration IS(first,second);
	favored_process : process_enumeration;
	p1_wants_to_enter,
	p2_wants_to_enter : boolean;
 
	PROCEDURE process_one IS
	BEGIN
		LOOP
			p1_wants_to_enter := true;
			WHILE p2_wants_to_enter LOOP
				IF favored_process = second THEN
					p1_wants_to_enter := false;
					WHILE favored_process = second LOOP
						NULL;
					END LOOP;
					p1_wants_to_enter := true;
				END IF;
			END LOOP;
			critical_section_one;
			favored_process := second;
			p1_wants_to_enter := false;
			other_stuff_one;
		END LOOP;
	END process_one;
	PROCEDURE process_two IS
	BEGIN
		LOOP
			p2_wants_to_enter := true;
			WHILE p1_wants_to_enter LOOP
				IF favored_process = first THEN
					p2_wants_to_enter := false;
					WHILE favored_process = first LOOP
						NULL;
					END LOOP;
					p2_wants_to_enter := true;
				END IF;
			END LOOP;
			critical_section_two;
			favored_process := first;
			p2_wants_to_enter := false;
			other_stuff_two;
		END LOOP;
	END process_two;
 
	BEGIN
		p1_wants_to_enter := false;
		p2_wants_to_enter := false;
		favored_process := first;
		PARBEGIN
			process_one;
			process_two;
		PAREND;
	END dekker_s_algorithm;