The Dijkstra–Scholten algorithm (named after Edsger W. Dijkstra and Carel S. Scholten) is an algorithm for detecting termination in a distributed system.
analysis | functional analysis | Fourier analysis | Mathematical analysis | mathematical analysis | Infrared Processing and Analysis Center | Genetic analysis | Termination of employment | harmonic analysis | Termination Bliss | SWOT analysis | International Institute for Applied Systems Analysis | Formal concept analysis | Cluster analysis | Behavioral Analysis Unit | Schenkerian analysis | Isotope analysis | intelligence analysis | Asymptotic analysis | Trend analysis | The New Class: An Analysis of the Communist System | Synchronic analysis | Regression analysis | performance analysis | Musical analysis | International Institute of Business Analysis | Intelligence analysis | IEEE Transactions on Pattern Analysis and Machine Intelligence | Gravimetric analysis | Fundamental analysis |
Like all programs for termination analysis it tries to solve the halting problem for particular cases, since the general problem is undecidable.