Solution of a Problem in Concurrent Programming Control

A number of mainly independent sequential-cyclic
processes with restricted means of communication 
with each other can be made in such a way that at any
moment one and only one of them is engaged in the 
"critical section" of its cycle.

CACM September, 1965

Dijkstra, E. W.

CA650908 JB March 6, 1978  7:24 PM

1198	5	1198
1198	5	1198
1198	5	1198
1781	5	1198
2150	5	1198
2228	5	1198
2256	5	1198
2317	5	1198
2342	5	1198
2376	5	1198
2618	5	1198
3184	5	1198
123	6	1198
196	6	1198
919	6	1198
990	6	1198
1007	6	1198
1046	6	1198
1131	6	1198
1139	6	1198
1140	6	1198
1149	6	1198
1198	6	1198
1198	6	1198
1198	6	1198
1198	6	1198
1198	6	1198
1198	6	1198
1198	6	1198
1198	6	1198
1198	6	1198
1215	6	1198
1223	6	1198
1265	6	1198
1303	6	1198
1323	6	1198
1338	6	1198
1338	6	1198
1338	6	1198
1338	6	1198
1338	6	1198
1358	6	1198
1366	6	1198
1421	6	1198
1460	6	1198
1462	6	1198
1463	6	1198
1467	6	1198
1468	6	1198
1477	6	1198
1491	6	1198
1496	6	1198
1531	6	1198
1535	6	1198
1565	6	1198
1572	6	1198
1601	6	1198
1602	6	1198
1613	6	1198
1614	6	1198
1626	6	1198
1641	6	1198
1693	6	1198
1749	6	1198
1749	6	1198
1749	6	1198
1749	6	1198
1749	6	1198
1749	6	1198
1753	6	1198
1781	6	1198
1787	6	1198
1788	6	1198
205	6	1198
224	6	1198
249	6	1198
1877	6	1198
288	6	1198
1960	6	1198
316	6	1198
381	6	1198
398	6	1198
11	6	1198
2126	6	1198
2148	6	1198
2256	6	1198
404	6	1198
410	6	1198
463	6	1198
464	6	1198
483	6	1198
3184	6	1198
3188	6	1198
557	6	1198
584	6	1198
600	6	1198
680	6	1198
691	6	1198
763	6	1198
799	6	1198