Fatès N., (2014), A guided tour of asynchronous cellular automata, Journal of Cellular Automata: Vol. 9(5-6), pp. 387-416, preprint
Fatès N., and Morvan M., (2005), An Experimental Study of Robustness to Asynchronism for Elementary Cellular Automata, Complex Systems: Volume 16 / Issue 1, pp. 1-27.
Fatès N., Morvan M., N. Schabanel, and E. Thierry, (2006), Fully asynchronous behavior of double-quiescent elementary cellular automata, Theoretical Computer Science: Volume 362, pp. 1 - 16.
Harvey I., and Bossomaier T.R.J, (1997). Time Out of Joint: Attractors in Asynchronous Boolean Networks. In Husbands and Harvey (eds.), Proceedings of the Fourth European Conference on Artificial Life, 67-75, MIT Press.
Kanada Y. (1994). The Effects of Randomness in Asynchronous 1D Cellular Automata. Artificial Life IV.
Nehaniv, C. L. (2002). Evolution in Asynchronous Cellular Automata, Artificial Life VIII, 65-73, MIT Press.
Nehaniv, C. L. (2004). Asynchronous Automata Networks Can Emulate Any Synchronous Automata Network, International Journal of Algebra & Computation, 14(5-6):719-739.
Orponen, P. (1997). Computing with Truly Asynchronous Threshold Logic Networks. Theoretical Computer Science 174(1-2):123-136.
Sipper M, Tomassini M. and Capcarrere M.S. (1997). Evolving Asynchronous and Scalable Non-Uniform Cellular Automata. Proc. of Intl. Conf. on Artificial Neural Networks and Genetic Algorithms (ICANNGA97), Springer-Verlag.
Virtual Laboratory at Monash University Online simulations of asynchronous updating in cellular automata.
本文来自电脑杂谈,转载请注明本文网址:
http://www.pc-fly.com/a/shouji/article-51784-5.html