{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T15:59:41Z","timestamp":1765382381878,"version":"3.40.3"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031156281"},{"type":"electronic","value":"9783031156298"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-15629-8_22","type":"book-chapter","created":{"date-parts":[[2022,9,24]],"date-time":"2022-09-24T16:26:53Z","timestamp":1664036813000},"page":"403-449","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Basic Compositional Model for Spiking Neural Networks"],"prefix":"10.1007","author":[{"given":"Nancy","family":"Lynch","sequence":"first","affiliation":[]},{"given":"Cameron","family":"Musco","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,9,7]]},"reference":[{"key":"22_CR1","unstructured":"Chou, C.N., Wang, M.B.: ODE-inspired analysis for the biological version of Oja\u2019s rule in solving streaming PCA. In: Thirty-third Annual Conference on Learning Theory (COLT), July 2020. arXiv:1911.02363. Accessed November 2019"},{"key":"22_CR2","unstructured":"Chou, C.N., Wang, M.B., Yu, T.: A general framework for analyzing stochastic dynamics in learning algorithms, June 2020. arXiv:2006.06171"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"Dasgupta, S., Stevens, C.F., Navlakha, S.: A neural algorithm for a fundamental computing problem. Science 358(6364), 793\u2013796 (2017). http:\/\/courses.csail.mit.edu\/6.852\/brains\/papers\/DasguptaStevensNavlakha.pdf","DOI":"10.1126\/science.aam9868"},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Gerstner, W., Lehmann, M., Liakoni, V., Corneil, D., Brea, J.: Eligibility traces and plasticity on behavioral time scales: experimental support of neohebbian three-factor learning rules. Front. Neural Circ. 12(53) (2018)","DOI":"10.3389\/fncir.2018.00053"},{"key":"22_CR5","unstructured":"Haddad, S., Varacca, D. (eds.): 32nd International Conference on Concurrency Theory, CONCUR 2021, 24\u201327 August 2021, Virtual Conference. LIPIcs, vol. 203. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021). https:\/\/www.dagstuhl.de\/dagpub\/978-3-95977-203-7"},{"key":"22_CR6","unstructured":"Hitron, Y., Musco, C., Parter, M., Lynch, N.: Random sketching, clustering, and short-term memory in spiking neural networks. In: 11th Innovations in Theoretical Computer Science (ITCS 2020), Seattle, Washington, January 2020"},{"key":"22_CR7","unstructured":"Hitron, Y., Parter, M.: Counting to ten with two fingers: compressed counting with spiking neurons. In: European Symposium on Algorithms (ESA), Munich, Germany, September 2019"},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"Kaynar, D.K., Lynch, N., Segala, R., Vaandrager, F.: The Theory of Timed I\/O Automata. Synthesis Lectures on Computer Science, 2nd edn. Morgan and Claypool Publishers (2010)","DOI":"10.1007\/978-3-031-02003-2"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"Lazzaro, J., Ryckebusch, S., Mahowald, M.A., Mead, C.A.: Winner-take-all networks of $$o(n)$$ complexity. Technical report, DTIC Document (1988)","DOI":"10.21236\/ADA451466"},{"issue":"4","key":"22_CR10","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1038\/7286","volume":"2","author":"DK Lee","year":"1999","unstructured":"Lee, D.K., Itti, L., Koch, C., Braun, J.: Attention activates winner-take-all competition among visual filters. Nat. Neurosci. 2(4), 375\u2013381 (1999)","journal-title":"Nat. Neurosci."},{"issue":"11","key":"22_CR11","doi-asserted-by":"publisher","first-page":"2337","DOI":"10.1162\/0899766054796888","volume":"17","author":"R Legenstein","year":"2005","unstructured":"Legenstein, R., Naeger, C., Maass, W.: What can a neuron learn with spike-timing-dependent plasticity? Neural Comput. 17(11), 2337\u20132382 (2005)","journal-title":"Neural Comput."},{"key":"22_CR12","doi-asserted-by":"crossref","unstructured":"Lombo, A.E., Lares, J.E., Castellani, M., Chou, C.N., Lynch, N., Berggren, K.K.: A superconducting nanowire-based architecture for neuromorphic computing (2022, submitted)","DOI":"10.1088\/2634-4386\/ac86ef"},{"key":"22_CR13","volume-title":"Distributed Algorithms","author":"N Lynch","year":"1996","unstructured":"Lynch, N.: Distributed Algorithms. Morgan Kaufmann Publishers, Inc., San Mateo (1996)"},{"key":"22_CR14","doi-asserted-by":"publisher","first-page":"798","DOI":"10.1016\/j.neunet.2021.07.033","volume":"143","author":"N Lynch","year":"2021","unstructured":"Lynch, N., Mallmann-Trenn, F.: Learning hierarchically structured concepts. Neural Netw. 143, 798\u2013817 (2021)","journal-title":"Neural Netw."},{"key":"22_CR15","unstructured":"Lynch, N., Musco, C., Parter, M.: Computational tradeoffs in biological neural networks: self-stabilizing winner-take-all networks. In: Proceedings of the 8th Conference on Innovations in Theoretical Computer Science (ITCS) (2017). https:\/\/arxiv.org\/abs\/1610.02084"},{"key":"22_CR16","unstructured":"Lynch, N., Musco, C., Parter, M.: Neuro-RAM unit with applications to similarity testing and compression in spiking neural networks. In: Proceedings of the 2017 Internal Symposium on Distributed Computing (DISC) (2017). https:\/\/arxiv.org\/abs\/1706.01382"},{"key":"22_CR17","unstructured":"Lynch, N., Musco, C., Parter, M.: Winner-take-all computation in spiking neural networks, April 2019. arXiv:1904.12591"},{"issue":"1","key":"22_CR18","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/S0890-5401(03)00067-1","volume":"185","author":"N Lynch","year":"2003","unstructured":"Lynch, N., Segala, R., Vaandrager, F.: Hybrid I\/O automata. Inf. Comput. 185(1), 105\u2013157 (2003). Technical report MIT-LCS-TR-827d, MIT Laboratory for Computer Science, Cambridge, MA 02139, 13 January 2003","journal-title":"Inf. Comput."},{"issue":"4","key":"22_CR19","doi-asserted-by":"publisher","first-page":"977","DOI":"10.1137\/S0097539704446487","volume":"37","author":"N Lynch","year":"2007","unstructured":"Lynch, N., Segala, R., Vaandrager, F.: Observing branching structure through probabilistic contexts. SIAM J. Comput. 37(4), 977\u20131013 (2007)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"22_CR20","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1006\/inco.1995.1134","volume":"121","author":"N Lynch","year":"1995","unstructured":"Lynch, N., Vaandrager, F.: Forward and backward simulations \u2013 part I: untimed systems. Inf. Comput. 121(2), 214\u2013233 (1995)","journal-title":"Inf. Comput."},{"issue":"1","key":"22_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1996.0060","volume":"128","author":"N Lynch","year":"1996","unstructured":"Lynch, N., Vaandrager, F.: Forward and backward simulations \u2013 part II: timing-based systems. Inf. Comput. 128(1), 1\u201325 (1996)","journal-title":"Inf. Comput."},{"key":"22_CR22","doi-asserted-by":"crossref","unstructured":"Lynch, N.A., Tuttle, M.R.: Hierarchical correctness proofs for distributed algorithms. In: Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed Computing (PODC 1987), Vancouver, British Columbia, Canada, pp. 137\u2013151 (1987)","DOI":"10.1145\/41840.41852"},{"issue":"3","key":"22_CR23","first-page":"219","volume":"2","author":"NA Lynch","year":"1989","unstructured":"Lynch, N.A., Tuttle, M.R.: An introduction to input\/output automata. CWI-Q. 2(3), 219\u2013246 (1989). Centrum voor Wiskunde en Informatica, Amsterdam, The Netherlands. Technical Memo MIT\/LCS\/TM-373, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA 02139, November 1988","journal-title":"CWI-Q."},{"issue":"9","key":"22_CR24","doi-asserted-by":"publisher","first-page":"1659","DOI":"10.1016\/S0893-6080(97)00011-7","volume":"10","author":"W Maass","year":"1997","unstructured":"Maass, W.: Networks of spiking neurons: the third generation of neural network models. Neural Netw. 10(9), 1659\u20131671 (1997)","journal-title":"Neural Netw."},{"key":"22_CR25","doi-asserted-by":"crossref","unstructured":"Maass, W.: Neural computation with winner-take-all as the only nonlinear operation. In: Advances in Neural Information Processing Systems (NIPS), vol. 12, pp. 293\u2013299 (1999)","DOI":"10.1162\/089976600300014827"},{"key":"22_CR26","doi-asserted-by":"publisher","first-page":"2519","DOI":"10.1162\/089976600300014827","volume":"12","author":"W Maass","year":"2000","unstructured":"Maass, W.: On the computational power of winner-take-all. Neural Comput. 12, 2519\u20132535 (2000)","journal-title":"Neural Comput."},{"issue":"5","key":"22_CR27","doi-asserted-by":"publisher","first-page":"860","DOI":"10.1109\/JPROC.2014.2310593","volume":"102","author":"W Maass","year":"2014","unstructured":"Maass, W.: Noise as a resource for computation and learning in networks of spiking neurons. Proc. IEEE 102(5), 860\u2013880 (2014)","journal-title":"Proc. IEEE"},{"issue":"1","key":"22_CR28","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1006\/inco.1999.2806","volume":"153","author":"W Maass","year":"1999","unstructured":"Maass, W., Schmitt, M.: On the complexity of learning for spiking neurons with temporal coding. Inf. Comput. 153(1), 26\u201346 (1999)","journal-title":"Inf. Comput."},{"key":"22_CR29","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BF02478259","volume":"5","author":"W Mcculloch","year":"1943","unstructured":"Mcculloch, W., Pitts, W.: A logical calculus of ideas immanent in nervous activity. Bull. Math. Biophys. 5, 127\u2013147 (1943)","journal-title":"Bull. Math. Biophys."},{"key":"22_CR30","unstructured":"Musco, C.: The power of randomized algorithms: from numerical linear algebra to biological systems. Ph.D. thesis, Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, MA 02139, June 2018. Neural algorithms work covered in Chapter 5"},{"key":"22_CR31","unstructured":"Papadimitriou, C.H., Vempala, S.S.: Random projection in the brain and computation with assemblies of neurons. In: 10th Innovation in Theoretical Computer Science (ITCS 2019), San Diego, CA, pp. 57:1\u201357:19, January 2019. https:\/\/www.cc.gatech.edu\/vempala\/papers\/assemblies.pdf"},{"key":"22_CR32","unstructured":"Segala, R.: Modeling and verification of randomized distributed real-time systems. Ph.D. thesis, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA 02139, June 1995"},{"issue":"2","key":"22_CR33","first-page":"250","volume":"2","author":"R Segala","year":"1995","unstructured":"Segala, R., Lynch, N.: Probabilistic simulations for probabilistic processes. Nordic J. Comput. 2(2), 250\u2013273 (1995)","journal-title":"Nordic J. Comput."},{"issue":"12","key":"22_CR34","doi-asserted-by":"publisher","first-page":"2523","DOI":"10.1162\/neco_a_01242","volume":"31","author":"L Su","year":"2019","unstructured":"Su, L., Chang, C.J., Lynch, N.: Spike-based winner-take-all computation: fundamental limits and order-optimal circuits. Neural Comput. 31(12), 2523\u20132561 (2019)","journal-title":"Neural Comput."},{"key":"22_CR35","unstructured":"Toomey, E.: Superconducting nanowire electronics for alternative computing. Ph.D. thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, MA 02139, May 2020"},{"key":"22_CR36","doi-asserted-by":"publisher","DOI":"10.1021\/acs.nanolett.0c03057","author":"E Toomey","year":"2020","unstructured":"Toomey, E., Segall, K., Castellani, M., Colangelo, M., Lynch, N., Berggren, K.K.: A superconducting nanowire spiking element for neural networks. Nano Lett. (2020). https:\/\/doi.org\/10.1021\/acs.nanolett.0c03057","journal-title":"Nano Lett."},{"key":"22_CR37","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780199568413.001.0001","volume-title":"Fundamentals of Computational Neuroscience","author":"T Trappenberg","year":"2009","unstructured":"Trappenberg, T.: Fundamentals of Computational Neuroscience. OUP, Oxford (2009)"},{"key":"22_CR38","volume-title":"Circuits of the Mind","author":"LG Valiant","year":"2000","unstructured":"Valiant, L.G.: Circuits of the Mind. Oxford University Press, Oxford (2000)"},{"key":"22_CR39","unstructured":"Wang, B.: Mathematical analysis of static and plastic biological neural circuits. Master\u2019s thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, MA, May 2020"},{"key":"22_CR40","unstructured":"Wang, B., Lynch, N.: Integrating temporal information to spatial information in a neural circuit (2019). arXiv:1903.01217"}],"container-title":["Lecture Notes in Computer Science","A Journey from Process Algebra via Timed Automata to Model Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-15629-8_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,27]],"date-time":"2023-11-27T17:35:44Z","timestamp":1701106544000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-15629-8_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031156281","9783031156298"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-15629-8_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"7 September 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}