Issue No. 03 - May (1982 vol. 8)
N. Francez , Department of Computer Science, Technion-Israel Institute of Technology
An efficient algorithm for achieving distributed termination without introducing new communicaton channels and without delaying the basic computations ("freezing") is presented. The algorithm is related to the methodology of designing distributed programs where the programmer is relieved from the problem of distributed termination. An informal correctness proof and complexity analysis are included.
distributed termination, Communication, concurrency, CSP, distributed programs
N. Francez and M. Rodeh, "Achieving Distributed Termination without Freezing," in IEEE Transactions on Software Engineering, vol. 8, no. , pp. 287-292, 1982.