About the Termination Detection in the Asynchronous Message Passing Model

1. Angluin, D.: Local and Global Properties in Networks of Processors. In: Proceedings of the 12th Symposium on Theory of Computing, pp. 82–93 (1980)

   Google Scholar 

2. Attiya, H., Welch, J.: Distributed Computing: Fundamentals, Simulations, and Advanced Topics. John Wiley & Sons, Chichester (2004)

   Google Scholar 

3. Bodlaender, H.-L., Van Leeuwen, J.: Simulation of Large Networks on Smaller Networks. Information and Control 71, 143–180 (1986)

   Article  MATH  MathSciNet  Google Scholar 

4. Bodlaender, H.-L.: The Classification of Coverings of Processor Networks. Journal of Parallel and Distributed Computing 6, 166–182 (1989)

   Article  Google Scholar 

5. Boldi, P., Vigna, S.: Computing Anonymously with Arbitrary Knowledge. In: Proceedings of the 18th ACM Symposium on Principles of Distributed Computing, pp. 181–188. ACM Press, New York (1999)

   Google Scholar 

6. Boldi, P., Vigna, S.: An Effective Characterization of Computability in Anonymous Networks. In: Welch, J.L. (ed.) DISC 2001. LNCS, vol. 2180, pp. 33–47. Springer, Heidelberg (2001)

   Chapter  Google Scholar 

7. Boldi, P., Vigna, S.: Fibrations of Graphs. Discrete Math. 243, 21–66 (2002)

   Article  MATH  MathSciNet  Google Scholar 

8. Chalopin, J., Métivier, Y.: A Bridge Between the Asynchronous Message Passing Model and Local Computations in Graphs. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol. 3618, pp. 212–223. Springer, Heidelberg (2005)

   Chapter  Google Scholar 

9. Godard, E., Métivier, Y.: A Characterization of Families of Graphs in Which Election Is Possible. In: Nielsen, M., Engberg, U. (eds.) ETAPS 2002 and FOSSACS 2002. LNCS, vol. 2303, pp. 159–171. Springer, Heidelberg (2002)

   Chapter  Google Scholar 

10. Godard, E., Métivier, Y., Tel, G.: Detection of the Termination of Distributed Algorithms. Submitted

    Google Scholar 

11. Itai, A., Rodeh, M.: Symmetry Breaking in Distributive Networks. In: Proceedings of the 13th Symposium on Theory of Computing, pp. 150–158 (1981)

    Google Scholar 

12. Mattern, F.: Algorithms for Distributed Termination Detection. Distributed Computing 2, 161–175 (1987)

    Article  Google Scholar 

13. Mazurkiewicz, A.: Distributed Enumeration. Inf. Processing Letters 61, 233–239 (1997)

    Article  MathSciNet  Google Scholar 

14. Métivier, Y., Muscholl, A., Wacrenier, P.-A.: About the Local Detection of Termination of Local Computations in Graphs. In: Krizanc, D., Widmayer, P. (eds.) SIROCCO97 – 4th International Colloquium on Structural Information & Communication Complexity. Proceedings in Informatics, pp. 188–200. Carleton Scientific, Waterloo (1997)

    Google Scholar 

15. Métivier, Y., Tel, G.: Termination Detection and Universal Graph Reconstruction. In: SIROCCO00 – 7th International Colloquium on Structural Information & Communication Complexity, pp. 237–251 (2000)

    Google Scholar 

16. Szymanski, B., Shy, Y., Prywes, N.: Synchronized Distributed Termination. IEEE Transactions on Software Engineering 11(10), 1136–1140 (1985)

    Article  Google Scholar 

17. Tel, G.: Introduction to Distributed Algorithms. Cambridge University Press, Cambridge (2000)

    MATH  Google Scholar 

18. Yamashita, M., Kameda, T.: Computing on Anonymous Networks: Part i – Characterizing the Solvable Cases. IEEE Transactions on Parallel and Distributed Systems 7(1), 69–89 (1996)

    Article  Google Scholar 

Download references