{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T11:00:27Z","timestamp":1776337227983,"version":"3.51.2"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,1,23]],"date-time":"2020-01-23T00:00:00Z","timestamp":1579737600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,23]],"date-time":"2020-01-23T00:00:00Z","timestamp":1579737600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Nat Comput"],"published-print":{"date-parts":[[2020,3]]},"DOI":"10.1007\/s11047-020-09782-7","type":"journal-article","created":{"date-parts":[[2020,1,23]],"date-time":"2020-01-23T13:02:48Z","timestamp":1579784568000},"page":"179-197","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["A tutorial on elementary cellular automata with fully asynchronous updating"],"prefix":"10.1007","volume":"19","author":[{"given":"Nazim","family":"Fat\u00e8s","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,1,23]]},"reference":[{"issue":"4","key":"9782_CR1","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/j.chaos.2012.01.002","volume":"45","author":"JM Baetens","year":"2012","unstructured":"Baetens JM, Van der Wee\u00ebn P, De Baets B (2012) Effect of asynchronous updating on the stability of cellular automata. Chaos Solitons Fractals 45(4):383\u2013394. https:\/\/doi.org\/10.1016\/j.chaos.2012.01.002","journal-title":"Chaos Solitons Fractals"},{"key":"9782_CR2","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-319-65558-1_3","volume-title":"Basic ideas to approach metastability in probabilistic cellular automata","author":"ENM Cirillo","year":"2018","unstructured":"Cirillo ENM, Nardi FR, Spitoni C (2018) Basic ideas to approach metastability in probabilistic cellular automata. Springer, Cham, pp 37\u201351. https:\/\/doi.org\/10.1007\/978-3-319-65558-1_3"},{"issue":"2","key":"9782_CR3","doi-asserted-by":"publisher","first-page":"165","DOI":"10.3233\/FI-2012-755","volume":"120","author":"A Dennunzio","year":"2012","unstructured":"Dennunzio A, Formenti E, Manzoni L (2012) Computing issues of asynchronous CA. Fundam Inform 120(2):165\u2013180. https:\/\/doi.org\/10.3233\/FI-2012-755","journal-title":"Fundam Inform"},{"key":"9782_CR4","series-title":"Modeling and Simulation in Science, Engineering and Technology","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4899-7980-3","volume-title":"Cellular Automaton Modeling of Biological Pattern Formation","author":"Andreas Deutsch","year":"2017","unstructured":"Deutsch A, Dormann S (2017) Cellular automaton modeling of biological pattern formation characterization, applications, and analysis. modeling and simulation in science, engineering and technology, 2nd edn. Birkh\u00e4user, Basel. https:\/\/doi.org\/10.1007\/978-1-4899-7980-3"},{"key":"9782_CR5","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-642-40867-0_3","volume-title":"Cellular Automata and Discrete Complex Systems","author":"Nazim Fat\u00e8s","year":"2013","unstructured":"Fat\u00e8s N (2013) A note on the classification of the most simple asynchronous cellular automata. In: Kari J, Kutrib M, Malcher A (eds.) Proceedings of Automata\u201913, Lecture Notes in Computer Science, vol 8155. Springer, pp 31\u201345. https:\/\/doi.org\/10.1007\/978-3-642-40867-0_3"},{"issue":"5\u20136","key":"9782_CR6","first-page":"387","volume":"9","author":"N Fat\u00e8s","year":"2014","unstructured":"Fat\u00e8s N (2014) A guided tour of asynchronous cellular automata. J Cell Automata 9(5\u20136):387\u2013416","journal-title":"J Cell Automata"},{"key":"9782_CR7","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1007\/978-3-319-11520-7_62","volume-title":"Lecture Notes in Computer Science","author":"Nazim Fat\u00e8s","year":"2014","unstructured":"Fat\u00e8s N (2014) Quick convergence to a fixed point: A note on asynchronous elementary cellular automata. In: Was J, Sirakoulis GC, Bandini S (eds.) Proceedings of ACRI\u201914, Lecture Notes in Computer Science, vol 8751. Springer, pp 586\u2013595. https:\/\/doi.org\/10.1007\/978-3-319-11520-7_62"},{"key":"9782_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-27737-5_671-2","volume-title":"Encyclopedia of Complexity and Systems Science","author":"Nazim Fat\u00e8s","year":"2018","unstructured":"Fat\u00e8s N (2018) Asynchronous cellular automata. Springer, pp 1\u201321. https:\/\/doi.org\/10.1007\/978-3-642-27737-5_671-2"},{"issue":"4","key":"9782_CR9","first-page":"323","volume":"4","author":"N Fat\u00e8s","year":"2009","unstructured":"Fat\u00e8s N, Gerin L (2009) Examples of fast and slow convergence of 2D asynchronous cellular systems. J Cell Automata 4(4):323\u2013337","journal-title":"J Cell Automata"},{"key":"9782_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2006.05.036","volume":"362","author":"N Fat\u00e8s","year":"2006","unstructured":"Fat\u00e8s N, Morvan M, Schabanel N, Thierry E (2006) Fully asynchronous behavior of double-quiescent elementary cellular automata. Theor Comput Sci 362:1\u201316. https:\/\/doi.org\/10.1016\/j.tcs.2006.05.036","journal-title":"Theor Comput Sci"},{"key":"9782_CR11","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/11682462_43","volume-title":"LATIN 2006: Theoretical Informatics","author":"Nazim Fat\u00e8s","year":"2006","unstructured":"Fat\u00e8s N, Regnault D, Schabanel N, Thierry E (2006) Asynchronous behavior of double-quiescent elementary cellular automata. In: Correa JR, Hevia A, Kiwi MA (eds) Proceedings of LATIN 2006, Lecture Notes in Computer Science, vol 3887. Springer, pp 455\u2013466. https:\/\/doi.org\/10.1007\/11682462_43"},{"key":"9782_CR12","series-title":"Emergence, Complexity and Computation","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-73216-9","volume-title":"Reversibility and Universality","year":"2018","unstructured":"Fat\u00e8s N, Sethi B, Das S (2018) On the reversibility of ECAs with fully asynchronous updating: The recurrence point of view. In: Adamatzky A (ed) Reversibility and universality, essays presented to Kenichi Morita on the occasion of his 70th birthday. Emergence, complexity and computation, vol 30. Springer, pp 313\u2013332. https:\/\/doi.org\/10.1007\/978-3-319-73216-9"},{"key":"9782_CR13","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/978-3-319-65558-1_12","volume-title":"Probabilistic cellular automata: theory, applications and future perspectives","author":"L Gerin","year":"2018","unstructured":"Gerin L (2018) Epidemic automaton and the Eden model: various aspects of robustness. In: Probabilistic cellular automata: theory, applications and future perspectives. Springer, Cham, pp 165\u2013178. https:\/\/doi.org\/10.1007\/978-3-319-65558-1_12"},{"issue":"1\u20133","key":"9782_CR14","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.tcs.2004.11.021","volume":"334","author":"J Kari","year":"2005","unstructured":"Kari J (2005) Theory of cellular automata: a survey. Theor Comput Sci 334(1\u20133):3\u201333. https:\/\/doi.org\/10.1016\/j.tcs.2004.11.021","journal-title":"Theor Comput Sci"},{"key":"9782_CR15","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-319-73216-9_6","volume-title":"Reversibility and Universality","author":"Martin Kutrib","year":"2018","unstructured":"Kutrib M, Malcher A (2018) Cellular automata: descriptional complexity and decidability. In: Adamatzky A (ed) Reversibility and universality, essays presented to Kenichi Morita on the occasion of his 70th birthday. Emergence, complexity and computation, vol 30. Springer, pp. 129\u2013168. https:\/\/doi.org\/10.1007\/978-3-319-73216-9_6"},{"key":"9782_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38771-5","volume-title":"Developments in Language Theory","year":"2013","unstructured":"Regnault D (2013) Proof of a phase transition in probabilistic cellular automata. In: B\u00e9al MP, Carton O (eds) Proceedings of developments in language theory. Lecture Notes in Computer Science, vol 7907. Springer, pp 433\u2013444. https:\/\/doi.org\/10.1007\/978-3-642-38771-5"},{"issue":"47\u201349","key":"9782_CR17","doi-asserted-by":"publisher","first-page":"4844","DOI":"10.1016\/j.tcs.2009.06.024","volume":"410","author":"D Regnault","year":"2009","unstructured":"Regnault D, Schabanel N, Thierry E (2009) Progresses in the analysis of stochastic 2D cellular automata: a study of asynchronous 2D minority. Theor Comput Sci 410(47\u201349):4844\u20134855. https:\/\/doi.org\/10.1016\/j.tcs.2009.06.024","journal-title":"Theor Comput Sci"},{"issue":"30","key":"9782_CR18","doi-asserted-by":"publisher","first-page":"3947","DOI":"10.1016\/j.tcs.2011.02.028","volume":"412","author":"JB Rouquier","year":"2011","unstructured":"Rouquier JB, Regnault D, Thierry E (2011) Stochastic minority on graphs. Theor Comput Sci 412(30):3947\u20133963. https:\/\/doi.org\/10.1016\/j.tcs.2011.02.028","journal-title":"Theor Comput Sci"},{"key":"9782_CR19","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/j.ins.2019.04.045","volume":"493","author":"EL Ruivo","year":"2019","unstructured":"Ruivo EL, de Oliveira PP (2019) A perfect solution to the parity problem with elementary cellular automaton 150 under asynchronous update. Inf Sci 493:138\u2013151. https:\/\/doi.org\/10.1016\/j.ins.2019.04.045","journal-title":"Inf Sci"},{"issue":"4","key":"9782_CR20","doi-asserted-by":"publisher","first-page":"043143","DOI":"10.1063\/1.4771662","volume":"22","author":"M Sch\u00fcle","year":"2012","unstructured":"Sch\u00fcle M, Stoop R (2012) A full computation-relevant topological dynamics classification of elementary cellular automata. Chaos 22(4):043143. https:\/\/doi.org\/10.1063\/1.4771662","journal-title":"Chaos"},{"key":"9782_CR21","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-319-06089-7_4","volume-title":"Lecture Notes in Computer Science","author":"Biswanath Sethi","year":"2014","unstructured":"Sethi B, Fat\u00e8s N, Das S (2014) Reversibility of elementary cellular automata under fully asynchronous update. In: Gopal T, Agrawal M, Li A, Cooper B (eds) Proceedings of TAMC\u201914, Lecture Notes in Computer Science, vol 8402. Springer, pp 39\u201349. https:\/\/doi.org\/10.1007\/978-3-319-06089-7_4"},{"issue":"5\u20136","key":"9782_CR22","first-page":"527","volume":"13","author":"B Sethi","year":"2018","unstructured":"Sethi B, Roy S, Das S (2018) Convergence of asynchronous cellular automata: does size matter? J Cell Automata 13(5\u20136):527\u2013542","journal-title":"J Cell Automata"},{"issue":"4","key":"9782_CR23","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/s11047-013-9387-4","volume":"12","author":"Fernando Silva","year":"2013","unstructured":"Silva F, Correia L (2013) An experimental study of noise and asynchrony in elementary cellular automata with sampling compensation. In: Natural computing, pp 1\u201316. https:\/\/doi.org\/10.1007\/s11047-013-9387-4","journal-title":"Natural Computing"},{"issue":"4","key":"9782_CR24","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1098\/rsos.190381","volume":"6","author":"D Str\u00f6mbom","year":"2019","unstructured":"Str\u00f6mbom D, Hassan T, Hunter Greis W, Antia A (2019) Asynchrony induces polarization in attraction-based models of collective motion. R Soc Open Sci 6(4):190\u2013381. https:\/\/doi.org\/10.1098\/rsos.190381","journal-title":"R Soc Open Sci"},{"key":"9782_CR25","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-319-65558-1_13","volume-title":"Probabilistic cellular automata: theory, applications and future perspectives","author":"L Taggi","year":"2018","unstructured":"Taggi L (2018) Convergence time of probabilistic cellular automata on the torus. In: Probabilistic cellular automata: theory, applications and future perspectives. Springer, Cham, pp 179\u2013196. https:\/\/doi.org\/10.1007\/978-3-319-65558-1_13"},{"key":"9782_CR26","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1007\/978-3-642-33350-7_70","volume-title":"Lecture Notes in Computer Science","author":"Fernando Silva","year":"2012","unstructured":"Worsch T (2012) (Intrinsically?) universal asynchronous CA. In: Sirakoulis GC, Bandini S (eds) Proceedings of ACRI 2012, Lecture Notes in Computer Science. Springer, pp 689\u2013698. https:\/\/doi.org\/10.1007\/978-3-642-33350-7_70"}],"container-title":["Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-020-09782-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11047-020-09782-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-020-09782-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,22]],"date-time":"2021-01-22T01:09:27Z","timestamp":1611277767000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11047-020-09782-7"}},"subtitle":["General properties and convergence dynamics"],"short-title":[],"issued":{"date-parts":[[2020,1,23]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,3]]}},"alternative-id":["9782"],"URL":"https:\/\/doi.org\/10.1007\/s11047-020-09782-7","relation":{},"ISSN":["1567-7818","1572-9796"],"issn-type":[{"value":"1567-7818","type":"print"},{"value":"1572-9796","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,1,23]]},"assertion":[{"value":"23 January 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}