{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T15:33:27Z","timestamp":1780673607770,"version":"3.54.1"},"reference-count":33,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2013,2,1]],"date-time":"2013-02-01T00:00:00Z","timestamp":1359676800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61170036"],"award-info":[{"award-number":["61170036"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"FORMALISM","award":["TIN2007-66523"],"award-info":[{"award-number":["TIN2007-66523"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["J. Emerg. Technol. Comput. Syst."],"published-print":{"date-parts":[[2013,2]]},"abstract":"<jats:p>Random fluctuations will be a major factor interfering with the operation of nanometer scale electronic devices. This article presents circuit architectures that can exploit such fluctuations, if signals have a particle-like (discrete, token-based) character. We define an abstract circuit primitive that, though lacking functionality when used with fluctuation-free signals, becomes universal when fluctuations are allowed. Key to the power of a signal\u2019s fluctuations is the ability to explore the state space of a circuit. This ability is used to resolve deadlock situations, which could otherwise only be averted by increased design complexity. The results in this article suggest that in the design of future computers, signal fluctuations, rather than being an impediment to be avoided at any cost, may be an important ingredient to achieve efficient operation.<\/jats:p>","DOI":"10.1145\/2422094.2422097","type":"journal-article","created":{"date-parts":[[2013,2,22]],"date-time":"2013-02-22T19:25:04Z","timestamp":1361561104000},"page":"1-24","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":40,"title":["Brownian Circuits"],"prefix":"10.1145","volume":"9","author":[{"given":"Ferdinand","family":"Peper","sequence":"first","affiliation":[{"name":"National Institute of Information and Communications Technology, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jia","family":"Lee","sequence":"additional","affiliation":[{"name":"Chongqing University, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Josep","family":"Carmona","sequence":"additional","affiliation":[{"name":"Universitat Polit\u00e8cnica de Catalunya, Spain"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jordi","family":"Cortadella","sequence":"additional","affiliation":[{"name":"Universitat Polit\u00e8cnica de Catalunya, Spain"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kenichi","family":"Morita","sequence":"additional","affiliation":[{"name":"Hiroshima University, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2013,2]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02084158"},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1080\/14786442808674769"},{"key":"e_1_2_2_3_1","doi-asserted-by":"crossref","unstructured":"Clocksin W. and Mellish C. 2003. Programming in Prolog 5th Ed. Springer-Verlag.  Clocksin W. and Mellish C. 2003. Programming in Prolog 5th Ed. Springer-Verlag.","DOI":"10.1007\/978-3-642-55481-0"},{"key":"e_1_2_2_4_1","unstructured":"Commoner F. 1972. Deadlocks in petri nets. Tech. rep. CA-7206\/2311 Applied Data Research Wakefield Massachussets.  Commoner F. 1972. Deadlocks in petri nets. Tech. rep. CA-7206\/2311 Applied Data Research Wakefield Massachussets."},{"key":"e_1_2_2_5_1","first-page":"305","article-title":"Noise as a computational resource","volume":"2","author":"Dasmahapatra S.","year":"2006","unstructured":"Dasmahapatra , S. , Werner , J. , and Zauner , K.-P. 2006 . Noise as a computational resource . Int. J. Unconventional Comput. 2 , 4, 305 -- 319 . Dasmahapatra, S., Werner, J., and Zauner, K.-P. 2006. Noise as a computational resource. Int. J. Unconventional Comput. 2, 4, 305--319.","journal-title":"Int. J. Unconventional Comput."},{"key":"e_1_2_2_6_1","first-page":"549","article-title":"Investigations on the Theory of the Brownian Movement. Dover Publications, New York","volume":"17","author":"Einstein A.","year":"1956","unstructured":"Einstein , A. 1956 . Investigations on the Theory of the Brownian Movement. Dover Publications, New York , Chapter Translation of Annalen der Physik 17 , 549 -- 560 , 1905, 1--18. Einstein, A. 1956. Investigations on the Theory of the Brownian Movement. Dover Publications, New York, Chapter Translation of Annalen der Physik 17, 549--560, 1905, 1--18.","journal-title":"Chapter Translation of Annalen der Physik"},{"key":"e_1_2_2_7_1","unstructured":"Feynman R. Leighton R. and Sands M. 2006. The Feynman Lectures on Physics. Vol. I. Addison Wesley 1--9.  Feynman R. Leighton R. and Sands M. 2006. The Feynman Lectures on Physics . Vol. I. Addison Wesley 1--9."},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1002\/andp.200410132"},{"key":"e_1_2_2_9_1","volume-title":"Analysis of production schemata by petri nets. Tech. rep. TR-94","author":"Hack M.","unstructured":"Hack , M. 1972. Analysis of production schemata by petri nets. Tech. rep. TR-94 , Project MAC, MIT , Boston, MA . Hack, M. 1972. Analysis of production schemata by petri nets. Tech. rep. TR-94, Project MAC, MIT, Boston, MA."},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1063\/1.1853631"},{"key":"e_1_2_2_11_1","first-page":"1","article-title":"Brownian motors","volume":"14","author":"H\u00e4nggi P.","year":"2005","unstructured":"H\u00e4nggi , P. , Marchesoni , F. , and Nori , F. 2005 . Brownian motors . Annalender Physik 14 , 1 -- 3 , 51--70. H\u00e4nggi, P., Marchesoni, F., and Nori, F. 2005. Brownian motors. Annalender Physik 14, 1--3, 51--70.","journal-title":"Annalender Physik"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1063\/1.368926"},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNANO.2004.828526"},{"key":"e_1_2_2_14_1","volume-title":"Proceedings of Automata","author":"Lee J.","year":"2008","unstructured":"Lee , J. and Peper , F . 2008. On brownian cellular automata . In Proceedings of Automata 2008 . Luniver Press, UK, 278--291. Lee, J. and Peper, F. 2008. On brownian cellular automata. In Proceedings of Automata 2008. Luniver Press, UK, 278--291."},{"key":"e_1_2_2_15_1","doi-asserted-by":"crossref","unstructured":"Lee J.\n     and \n      Peper F\n  . \n  2010\n  . Efficient circuit construction in brownian cellular automata based on a new building block for delay-insensitive circuits. In Proceedings of the 9th International Conforence on Cellular Automata for Research and Industry (ACRI). S. Bandini S. Manzoni H. Umeo and G. Vizzari Eds. Lecture Notes in Computer Science Series vol. \n  6350 Springer Berkin 356--364.   Lee J. and Peper F. 2010. Efficient circuit construction in brownian cellular automata based on a new building block for delay-insensitive circuits. In Proceedings of the 9th International Conforence on Cellular Automata for Research and Industry (ACRI) . S. Bandini S. Manzoni H. Umeo and G. Vizzari Eds. Lecture Notes in Computer Science Series vol. 6350 Springer Berkin 356--364.","DOI":"10.1007\/978-3-642-15979-4_37"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2005.844229"},{"key":"e_1_2_2_17_1","doi-asserted-by":"crossref","unstructured":"McAdams H. and Arkin A. 1999. It\u2019s a noisy bussiness! Trends Genetics 15 2 65--69.  McAdams H. and Arkin A. 1999. It\u2019s a noisy bussiness! Trends Genetics 15 2 65--69.","DOI":"10.1016\/S0168-9525(98)01659-X"},{"key":"e_1_2_2_18_1","unstructured":"Mead C. and Conway L. 1980. Introduction to VLSI Systems. Addison-Wesley Longman Publishing Co. Inc. Boston MA.   Mead C. and Conway L. 1980. Introduction to VLSI Systems . Addison-Wesley Longman Publishing Co. Inc. Boston MA."},{"key":"e_1_2_2_19_1","doi-asserted-by":"crossref","unstructured":"Meindl J. Chen Q. and Davis J. 2001. Limits on silicon nanoelectronics for terascale integration. Science 293 5537 2044--2049.  Meindl J. Chen Q. and Davis J. 2001. Limits on silicon nanoelectronics for terascale integration. Science 293 5537 2044--2049.","DOI":"10.1126\/science.293.5537.2044"},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1982.1676110"},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/5.24143"},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1063\/1.1843271"},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1063\/1.2888744"},{"key":"e_1_2_2_24_1","volume-title":"Proceedings of the Workshop on Physics and Computation. 248--259","author":"Patra P.","unstructured":"Patra , P. and Fussell , D . 1996. Conservative delay-insensitive circuits . In Proceedings of the Workshop on Physics and Computation. 248--259 . Patra, P. and Fussell, D. 1996. Conservative delay-insensitive circuits. In Proceedings of the Workshop on Physics and Computation. 248--259."},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNANO.2004.824034"},{"key":"e_1_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.60.535"},{"key":"e_1_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0370-1573(01)00081-3"},{"key":"e_1_2_2_28_1","doi-asserted-by":"crossref","unstructured":"Rozenberg G.\n     and \n      Engelfriet J\n  . \n  1998\n  . Elementary net systems. In Lectures on Petri Nets I: Basic Models Advances in Petri Nets Lecture Notes in Computer Science Series vol. \n  1491 Springer-Verlag Berlin UK 12--121.   Rozenberg G. and Engelfriet J. 1998. Elementary net systems. In Lectures on Petri Nets I: Basic Models Advances in Petri Nets Lecture Notes in Computer Science Series vol. 1491 Springer-Verlag Berlin UK 12--121.","DOI":"10.1007\/3-540-65306-6_14"},{"key":"e_1_2_2_29_1","series-title":"Lecture Notes in Computer Science Series","volume-title":"Proceedings of the 9th Symposium on Mathematical Foundations of Computer Science (MFCS)","author":"Sifakis J.","unstructured":"Sifakis , J. 1980. Deadlocks and livelocks in transition systems . In Proceedings of the 9th Symposium on Mathematical Foundations of Computer Science (MFCS) . Lecture Notes in Computer Science Series , vol. 88 , Springer-Verlag , Berlin, UK , 587--600. Sifakis, J. 1980. Deadlocks and livelocks in transition systems. In Proceedings of the 9th Symposium on Mathematical Foundations of Computer Science (MFCS). Lecture Notes in Computer Science Series, vol. 88, Springer-Verlag, Berlin, UK, 587--600."},{"key":"e_1_2_2_30_1","doi-asserted-by":"crossref","unstructured":"Spars\u00f8 J. and Furber S. 2001. Principles of Asynchronous Circuit Design - A Systems Perspective. Kluwer Academic Publishers.   Spars\u00f8 J. and Furber S. 2001. Principles of Asynchronous Circuit Design - A Systems Perspective . Kluwer Academic Publishers.","DOI":"10.1007\/978-1-4757-3385-3"},{"key":"e_1_2_2_31_1","volume-title":"Markov Chains, Queues, and Simulation","author":"Steward W.","unstructured":"Steward , W. 2009. Probability , Markov Chains, Queues, and Simulation . Princeton University Press . Steward, W. 2009. Probability, Markov Chains, Queues, and Simulation. Princeton University Press."},{"key":"e_1_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1088\/0957-4484\/12\/1\/311"},{"key":"e_1_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.biosystems.2008.04.008"}],"container-title":["ACM Journal on Emerging Technologies in Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2422094.2422097","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2422094.2422097","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:18:35Z","timestamp":1750234715000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2422094.2422097"}},"subtitle":["Fundamentals"],"short-title":[],"issued":{"date-parts":[[2013,2]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,2]]}},"alternative-id":["10.1145\/2422094.2422097"],"URL":"https:\/\/doi.org\/10.1145\/2422094.2422097","relation":{},"ISSN":["1550-4832","1550-4840"],"issn-type":[{"value":"1550-4832","type":"print"},{"value":"1550-4840","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,2]]},"assertion":[{"value":"2011-03-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2012-02-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2013-02-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}