Analyzing program solutions of coordination problems by cp-nets
Remembering the history of DIJKSTRA's problem and of its various solutions it seems that this problem is vexatious enough to test how useful a formal model can be in describing and building up structures of concurrently running processes. Insofar, with the results mentioned above first steps have been made to solve and to analyze a larger class of coordination problems.
Unable to display preview. Download preview PDF.
- /1/.De Bruijn, N.G.: Additional Comments on a Problem in Concurrent Programming Control; CACM, Vol. 10 No. 3, pp. 137–138Google Scholar
- /2/.Dijkstra, E.W.: Solution of a Problem in Concurrent Programming Control; CACM, Vol. 8 No. 9, p. 569Google Scholar
- /3/.Eisenberg, M.A. and Mc Guire, M.R.: Further Comments on Dijkstra's Concurrent Programming Control Problem; CACM, Vol. 15 No. 11, p. 999Google Scholar
- /4/.Knuth, D.E.: Additional Comments on a Problem in Concurrent Programming Control; CACM, Vol. 9 No. 5, pp. 321–323Google Scholar
- /5/.Petri, C.A.: Non-Sequential Processes; GMD-ISF Report ISF-77-01Google Scholar
- /6/.Schiffers, M.: Behandlung eines Synchronisationsproblems mit gefärbten Petri-Netzen; Diplom thesis, Bonn 1977 (German)Google Scholar