1. Angluin, D., Aspnes, J., Chan, M., Fischer, M.J., Jiang, H., Peralta, R.: Stably computable properties of network graphs. In: Viktor K. Prasanna, Sitharama Iyengar, Paul Spirakis and Matt Welsh (eds.), Distributed Computing in Sensor Systems: First IEEE International Conference (2005). Lecture Notes in Computer Science 3560, 63–74 (June/July, 2005) Proceedings Marina del Rey, CA, USA
2. Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Urn automata. Tech. Rep. YALEU/DCS/TR–1280, Yale University Department of Computer Science (2003)
3. Berry, G., Boudol, G.: The chemical abstract machine. Theor. Comp. Sci. 96, 217–248 (1992)
4. Brand, D., Zafiropulo, P.: On communicating finite-state machines. J. ACM 30(2), 323–342 (1983)
5. Diamadi, Z., Fischer, M.J.: A simple game for the study of trust in distributed systems. Wuhan Univ. J. Natur. Sci. 6(1–2), 72–82 (2001). Also appears as Yale Technical Report TR–1207, January 2001, available at URL ftp://ftp.cs.yale.edu/pub/TR/tr1207.ps