Abstract
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.
Cite
CITATION STYLE
Schiffers, M., & Wedde, H. (1978). Analyzing program solutions of coordination problems by cp-nets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 64 LNCS, pp. 462–473). Springer Verlag. https://doi.org/10.1007/3-540-08921-7_94
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
