M. Bauderon, S. Gruner, Y. Métivier, M. Mosbah, and A. Sellami, Visualization of distributed algorithms based on labeled rewriting systems, Second International Workshop on Graph Transformation and Visual Modeling Techniques, pp.229-239, 2001.

M. Bauderon and M. Mosbah, A Unified Framework for Designing, Implementing and Visualizing Distributed Algorithms, GT- VMT'2002, Graph Transformation and Visual Modeling Techniques (First International Conference on Graph Transformation), pp.13-24, 2003.
DOI : 10.1016/S1571-0661(04)80608-X

M. Ben-ari, Interactive execution of distributed algorithms, Journal of Educational Resources in Computing, vol.1, issue.2es, 2001.
DOI : 10.1145/384055.384057

G. Bracha and S. Toueg, Distributed deadlock detection, Distributed Computing, pp.127-138, 1987.
DOI : 10.1007/BF01782773

S. Carr, C. Fang, T. Jozwowski, J. Mayo, and C. Shene, Concurrent mentor: A visualization system for distributed programming education, PDPTA'03, pp.1676-1682, 2003.

J. Chalopin, Y. Métivier, and T. Morsellino, On snapshots and stable properties detection in anonymous fully distributed systems. submitted, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00695582

K. M. Chandy and L. Lamport, Distributed snapshots: determining global states of distributed systems, ACM Transactions on Computer Systems, vol.3, issue.1, pp.63-75, 1985.
DOI : 10.1145/214451.214456

X. Chang, Network simulations with OPNET, Proceedings of the 31st conference on Winter simulation Simulation---a bridge to the future, WSC '99, pp.307-314, 1999.
DOI : 10.1145/324138.324232

B. Derbel and M. Mosbah, Distributing the execution of a distributed algorithm over a network, Proceedings on Seventh International Conference on Information Visualization, 2003. IV 2003., pp.485-490, 2003.
DOI : 10.1109/IV.2003.1218029
URL : https://hal.archives-ouvertes.fr/hal-00307547

R. Guerraoui and E. Ruppert, What can be implemented anonymously? In DISC, pp.244-259, 2005.

B. Koldehofe, M. Papatriantafilou, and P. Tsigas, Integrating a simulation-visualisation environment in a basic distributed systems course: a case study using lydian, Proceedings of the 8th annual conference on Innovation and technology in computer science education, ITiCSE '03, pp.35-39, 2003.

A. D. Kshemkalyani, Fast and Message-Efficient Global Snapshot Algorithms for Large-Scale Distributed Systems, IEEE Transactions on Parallel and Distributed Systems, vol.21, issue.9, pp.1281-1289, 2010.
DOI : 10.1109/TPDS.2010.24

A. D. Kshemkalyani, M. Raynal, and M. Singhal, An introduction to snapshot algorithms in distributed computing, Distributed Systems Engineering, pp.224-233, 1995.
DOI : 10.1088/0967-1846/2/4/005

A. D. Kshemkalyani and M. Singhal, Distributed computing, 2008.
DOI : 10.1017/CBO9780511805318

A. D. Kshemkalyani and B. Wu, Detecting Arbitrary Stable Properties Using Efficient Snapshots, IEEE Transactions on Software Engineering, vol.33, issue.5, pp.330-346, 2007.
DOI : 10.1109/TSE.2007.1000

K. Marzullo and L. S. Sabel, Efficient detection of a class of stable properties, Distributed Computing, vol.7, issue.3, pp.81-91, 1994.
DOI : 10.1007/BF02280830

J. Matocha and T. Camp, A taxonomy of distributed termination detection algorithms, Journal of Systems and Software, vol.43, issue.3, pp.207-221, 1998.
DOI : 10.1016/S0164-1212(98)10034-1

F. Mattern, Algorithms for distributed termination detection, Distributed computing, pp.161-175, 1987.
DOI : 10.1007/BF01782776

Y. Moses, Z. Polunsky, A. Tal, and L. Ulitsky, Algorithm visualization for distributed environments, Proceedings of the 1998 IEEE Symposium on Information Visualization, pp.71-78, 1998.

G. Pongor, Omnet: Objective modular network testbed, MASCOTS '93: Proceedings of the International Workshop on Modeling, Analysis, and Simulation On Computer and Telecommunication Systems, pp.323-326, 1993.

M. Raynal, Networks and distributed computation, 1988.

N. Santoro, Design and analysis of distributed algorithm, 2007.
DOI : 10.1002/0470072644

J. T. Stasko and E. Kraemer, A Methodology for Building Application-Specific Visualizations of Parallel Programs, Journal of Parallel and Distributed Computing, vol.18, issue.2, pp.258-264, 1993.
DOI : 10.1006/jpdc.1993.1062

B. Szymanski, Y. Shy, and N. Prywes, Synchronized Distributed Termination, IEEE Transactions on Software Engineering, vol.11, issue.10, pp.111136-1140, 1985.
DOI : 10.1109/TSE.1985.231861

G. Tel, Introduction to distributed algorithms, 2000.
DOI : 10.1017/CBO9781139168724

M. Yamashita and T. Kameda, Computing on an anonymous network, Proceedings of the seventh annual ACM Symposium on Principles of distributed computing , PODC '88, pp.69-89, 1996.
DOI : 10.1145/62546.62568