{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T04:03:52Z","timestamp":1746417832647,"version":"3.40.4"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319115191"},{"type":"electronic","value":"9783319115207"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-11520-7_38","type":"book-chapter","created":{"date-parts":[[2014,9,12]],"date-time":"2014-09-12T05:05:05Z","timestamp":1410498305000},"page":"367-377","source":"Crossref","is-referenced-by-count":0,"title":["Direction-Reversible Self-Timed Cellular Automata for Delay-Insensitive Circuits"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Morrison","sequence":"first","affiliation":[]},{"given":"Irek","family":"Ulidowski","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"6","key":"38_CR1","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1147\/rd.176.0525","volume":"17","author":"C.H. Bennett","year":"1973","unstructured":"Bennett, C.H.: Logical reversibility of computation. IBM Journal of Research and Development\u00a017(6), 525\u2013532 (1973)","journal-title":"IBM Journal of Research and Development"},{"issue":"3\/4","key":"38_CR2","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/BF01857727","volume":"21","author":"E.F. Fredkin","year":"1982","unstructured":"Fredkin, E.F., Toffoli, T.: Conservative logic. International Journal of Theoretical Physics\u00a021(3\/4), 219\u2013253 (1982)","journal-title":"International Journal of Theoretical Physics"},{"issue":"1","key":"38_CR3","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/T-C.1974.223773","volume":"23","author":"R.M. Keller","year":"1974","unstructured":"Keller, R.M.: Towards a theory of universal speed-independent modules. IEEE Transactions on Computers\u00a023(1), 21\u201333 (1974)","journal-title":"IEEE Transactions on Computers"},{"key":"38_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/3-540-53487-3_52","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"M.Z. Kwiatkowska","year":"1990","unstructured":"Kwiatkowska, M.Z.: Defining process fairness for non-interleaving concurrency. In: Veni Madhavan, C.E., Nori, K.V. (eds.) FSTTCS 1990. LNCS, vol.\u00a0472, pp. 286\u2013300. Springer, Heidelberg (1990)"},{"issue":"7","key":"38_CR5","doi-asserted-by":"publisher","first-page":"1211","DOI":"10.1093\/comjnl\/bxq089","volume":"54","author":"J. Lee","year":"2011","unstructured":"Lee, J., Adachi, S., Peper, F.: A partitioned cellular automaton approach for efficient implementation of asynchronous circuits. Comp. J.\u00a054(7), 1211\u20131220 (2011)","journal-title":"Comp. J."},{"issue":"3-4","key":"38_CR6","first-page":"295","volume":"58","author":"J. Lee","year":"2003","unstructured":"Lee, J., Adachi, S., Peper, F., Morita, K.: Embedding universal delay-insensitive circuits in asynchronous cellular spaces. Fundam. Inf.\u00a058(3-4), 295\u2013320 (2003)","journal-title":"Fundam. Inf."},{"key":"38_CR7","doi-asserted-by":"crossref","unstructured":"Lee, J., Huang, X., Zhu, Q.: Embedding simple reversed-twin elements into self-timed reversible cellular automata. J. Converg. Info. Tech.\u00a06(1) (2011)","DOI":"10.4156\/jcit.vol6.issue1.6"},{"key":"38_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-540-79992-4_9","volume-title":"Cellular Automata","author":"J. Lee","year":"2008","unstructured":"Lee, J., Peper, F., Adachi, S., Morita, K.: An asynchronous cellular automaton implementing 2-state 2-input 2-output reversed-twin reversible elements. In: Umeo, H., Morishita, S., Nishinari, K., Komatsuzaki, T., Bandini, S. (eds.) ACRI 2008. LNCS, vol.\u00a05191, pp. 67\u201376. Springer, Heidelberg (2008)"},{"key":"38_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/3-540-45833-6_19","volume-title":"Unconventional Models of Computation","author":"J. Lee","year":"2002","unstructured":"Lee, J., Peper, F., Adachi, S., Morita, K., Mashiko, S.: Reversible computation in asynchronous cellular automata. In: Calude, C.S., Dinneen, M.J., Peper, F. (eds.) UMC 2002. LNCS, vol.\u00a02509, pp. 220\u2013229. Springer, Heidelberg (2002)"},{"key":"38_CR10","doi-asserted-by":"crossref","unstructured":"Martin, A.J.: The limitations to delay-insensitivity in asynchronous circuits. In: Procs. of AUSCRIPT 1990, pp. 263\u2013278. MIT Press (1990)","DOI":"10.21236\/ADA447737"},{"key":"38_CR11","doi-asserted-by":"crossref","unstructured":"Morita, K.: Reversible computing systems, logic circuits, and cellular automata. In: ICNC 2012, pp. 1\u20138. IEEE Computer Society (2012)","DOI":"10.1109\/ICNC.2012.10"},{"key":"38_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/3-540-45132-3_6","volume-title":"Machines, Computations, and Universality","author":"K. Morita","year":"2001","unstructured":"Morita, K.: A simple universal logic element and cellular automata for reversible computing. In: Margenstern, M., Rogozhin, Y. (eds.) MCU 2001. LNCS, vol.\u00a02055, pp. 102\u2013113. Springer, Heidelberg (2001)"},{"key":"38_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/978-3-540-31834-7_20","volume-title":"Machines, Computations, and Universality","author":"K. Morita","year":"2005","unstructured":"Morita, K., Ogiro, T., Tanaka, K., Kato, H.: Classification and universality of reversible logic elements with one-bit memory. In: Margenstern, M. (ed.) MCU 2004. LNCS, vol.\u00a03354, pp. 245\u2013256. Springer, Heidelberg (2005)"},{"key":"38_CR14","unstructured":"Morrison, D.: Homepage, Department of Computer Science, University of Leicester (2014), http:\/\/www.cs.le.ac.uk\/people\/dm181"},{"key":"38_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-319-08494-7_6","volume-title":"Reversible Computation","author":"D. Morrison","year":"2014","unstructured":"Morrison, D., Ulidowski, I.: Arbitration and reversibility of parallel delay-insensitive modules. In: Yamashita, S., Minato, S.-I. (eds.) RC 2014. LNCS, vol.\u00a08507, pp. 67\u201381. Springer, Heidelberg (2014)"},{"key":"38_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-642-38986-3_2","volume-title":"Reversible Computation","author":"D. Morrison","year":"2013","unstructured":"Morrison, D., Ulidowski, I.: Reversible delay-insensitive distributed memory modules. In: Dueck, G.W., Miller, D.M. (eds.) RC 2013. LNCS, vol.\u00a07948, pp. 11\u201324. Springer, Heidelberg (2013)"},{"key":"38_CR17","doi-asserted-by":"crossref","unstructured":"Patra, P., Fussell, D.S.: Efficient building blocks for delay insensitive circuits. In: Procs. of Async 1994, pp. 196\u2013205. Society Press (1994)","DOI":"10.1109\/ASYNC.1994.656312"},{"key":"38_CR18","doi-asserted-by":"crossref","unstructured":"Patra, P., Fussell, D.S.: Efficient delay-insensitive RSFQ circuits. In: Procs. of ICCD 1996, pp. 413\u2013418. IEEE Computer Society (1996)","DOI":"10.1109\/ICCD.1996.563587"},{"issue":"7","key":"38_CR19","doi-asserted-by":"publisher","first-page":"893","DOI":"10.1016\/S0167-739X(02)00069-9","volume":"18","author":"F. Peper","year":"2002","unstructured":"Peper, F., Isokawa, T., Kouda, N., Matsui, N.: Self-timed cellular automata and their computational ability. Future Gener. Comput. Syst.\u00a018(7), 893\u2013904 (2002)","journal-title":"Future Gener. Comput. Syst."},{"issue":"4","key":"38_CR20","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1088\/0957-4484\/14\/4\/312","volume":"14","author":"F. Peper","year":"2003","unstructured":"Peper, F., Lee, J., Adachi, S., Mashiko, S.: Laying out circuits on asynchronous cellular arrays: a step towards feasible nanocomputers? Nanotechnology\u00a014(4), 469 (2003)","journal-title":"Nanotechnology"},{"key":"38_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/978-3-642-33350-7_58","volume-title":"Cellular Automata","author":"O. Schneider","year":"2012","unstructured":"Schneider, O., Worsch, T.: A 3-state asynchronous CA for the simulation of delay-insensitive circuits. In: Sirakoulis, G.C., Bandini, S. (eds.) ACRI 2012. LNCS, vol.\u00a07495, pp. 565\u2013574. Springer, Heidelberg (2012)"}],"container-title":["Lecture Notes in Computer Science","Cellular Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-11520-7_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T16:02:58Z","timestamp":1746374578000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-11520-7_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319115191","9783319115207"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-11520-7_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}