{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T16:30:58Z","timestamp":1775061058274,"version":"3.50.1"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032224682","type":"print"},{"value":"9783032224699","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-22469-9_2","type":"book-chapter","created":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:58:03Z","timestamp":1775055483000},"page":"20-40","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Compositional Control-Driven Boolean Circuits"],"prefix":"10.1007","author":[{"given":"Damian","family":"Arellanes","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,4,2]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Arellanes, D.: Composition machines: programming self-organising software models for the emergence of sequential program spaces. In: 18th International Symposium on Theoretical Aspects of Software Engineering (TASE), pp. 19\u201337. Springer (2024)","DOI":"10.1007\/978-3-031-64626-3_2"},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3389\/fcomp.2025.1564048","volume":"7","author":"D Arellanes","year":"2025","unstructured":"Arellanes, D.: Models of high-level computation. Front. Comput. Sci. 7, 1\u20137 (2025)","journal-title":"Front. Comput. Sci."},{"key":"2_CR3","doi-asserted-by":"publisher","unstructured":"Arellanes, D.: Compositional separation of control flow and data flow. J. Logical Algebraic Methods Program., 101125 (2026). https:\/\/doi.org\/10.1016\/j.jlamp.2026.101125","DOI":"10.1016\/j.jlamp.2026.101125"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Asadi, F.: Multiplexer and de-multiplexer. in: digital circuits laboratory manual, pp. 81\u2013104. Synthesis Lectures on Electrical Engineering, Springer, Cham (2024)","DOI":"10.1007\/978-3-031-41516-6_4"},{"issue":"4","key":"2_CR5","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1017\/S0960129522000317","volume":"32","author":"F Bonchi","year":"2022","unstructured":"Bonchi, F., Gadducci, F., Kissinger, A., Sobocinski, P., Zanasi, F.: String diagram rewrite theory II: Rewriting with symmetric monoidal structure. Math. Struct. Comput. Sci. 32(4), 511\u2013541 (2022)","journal-title":"Math. Struct. Comput. Sci."},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Brown, B., Card, H.: Stochastic neural computation. I. Computational elements. IEEE Trans. Comput. 50(9), 891\u2013905 (2001)","DOI":"10.1109\/12.954505"},{"key":"2_CR7","unstructured":"Chakrapani, L.N.B., Palem, K.V.: A Probabilistic Boolean Logic and its Meaning. Tech. Rep. TR08-05, Rice University, Department of Computer Science, Houston, Texas, USA (2008)"},{"key":"2_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04943-3","volume-title":"Boolean Functions and Computation Models","author":"P Clote","year":"2002","unstructured":"Clote, P., Kranakis, E.: Boolean Functions and Computation Models, 1st edn. Texts in Theoretical Computer Science. An EATCS Series, Springer, Berlin, Heidelberg (2002)","edition":"1"},{"key":"2_CR9","unstructured":"Dardik, I., Porter, A., Kang, E.: Recomposition: a new technique for efficient compositional verification. In: 24th Conference on Formal Methods in Computer-Aided Design (FMCAD), pp. 130\u2013141 (2024)"},{"key":"2_CR10","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-030-90636-8_4","volume-title":"17th International Conference on Formal Aspects of Component Software (FACS)","author":"E Di Lavore","year":"2021","unstructured":"Di Lavore, E., Gianola, A., Rom\u00e1n, M., Sabadini, N., Soboci\u0144ski, P.: A canonical algebra of open transition systems. In: Sala\u00fcn, G., Wijs, A. (eds.) 17th International Conference on Formal Aspects of Component Software (FACS), pp. 63\u201381. Springer, Cham (2021)"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Ehresmann, A.C., Vanbremeersch, J.P.: Memory Evolutive Systems; Hierarchy, Emergence, Cognition, vol.\u00a04. Elsevier, 1st edn. (2007)","DOI":"10.1016\/S1571-0831(06)04001-9"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Fahrenberg, U., Johansen, C., Struth, G., Ziemianski, K.: Languages of higher-dimensional automata. Math. Struct. Comput. Scie. 31(5) (2021)","DOI":"10.1017\/S0960129521000293"},{"key":"2_CR13","unstructured":"Fahrenberg, U., Johansen, C., Struth, G., Ziemianski, K.: A kleene theorem for higher-dimensional automata. In: 33rd International Conference on Concurrency Theory (CONCUR 2022), pp. 1\u201318 (2022)"},{"key":"2_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ijar.2023.108943","volume":"159","author":"T Flaminio","year":"2023","unstructured":"Flaminio, T., Gilio, A., Godo, L., Sanfilippo, G.: On conditional probabilities and their canonical extensions to Boolean algebras of compound conditionals. Int. J. Approx. Reason. 159, 1\u201331 (2023)","journal-title":"Int. J. Approx. Reason."},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Ghica, D.R., Jung, A.: Categorical semantics of digital circuits. In: 16th Conference on Formal Methods in Computer-Aided Design (FMCAD), pp. 41\u201348 (2016)","DOI":"10.1109\/FMCAD.2016.7886659"},{"key":"2_CR16","unstructured":"Ghica, D.R., Jung, A., Lopez, A.: Diagrammatic semantics for digital circuits. In: Goranko, V., Dam, M. (eds.) 26th EACSL Annual Conference on Computer Science Logic (CSL). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a082, pp. 1\u201316. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2017)"},{"key":"2_CR17","unstructured":"Ghica, D.R., Kaye, G., Sprunger, D.: A Complete Theory of Sequential Digital Circuits: Denotational, Operational and Algebraic Semantics (2025)"},{"key":"2_CR18","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/978-3-319-10575-8_12","volume-title":"Handbook of Model Checking","author":"D Giannakopoulou","year":"2018","unstructured":"Giannakopoulou, D., Namjoshi, K.S., P\u0103s\u0103reanu, C.S.: Compositional Reasoning. In: Clarke, E.M., Henzinger, T.A., Veith, H., Bloem, R. (eds.) Handbook of Model Checking, pp. 345\u2013383. Springer, Cham (2018)"},{"issue":"2","key":"2_CR19","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1051\/ita:2002009","volume":"36","author":"P Katis","year":"2002","unstructured":"Katis, P., Sabadini, N., Walters, R.F.C.: Feedback, trace and fixed-point semantics. RAIRO - Theor. Inform. Appl. 36(2), 181\u2013194 (2002)","journal-title":"RAIRO - Theor. Inform. Appl."},{"issue":"2","key":"2_CR20","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/S0022-4049(03)00069-0","volume":"184","author":"Y Lafont","year":"2003","unstructured":"Lafont, Y.: Towards an algebraic theory of Boolean circuits. J. Pure Appl. Algebra 184(2), 257\u2013310 (2003)","journal-title":"J. Pure Appl. Algebra"},{"issue":"4","key":"2_CR21","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1007\/s10598-022-09547-0","volume":"32","author":"SA Lozhkin","year":"2021","unstructured":"Lozhkin, S.A., Khzmalyan, D.E.: The complexity of the standard multiplexer function in a class of switching circuits. Comput. Math. Model. 32(4), 478\u2013489 (2021)","journal-title":"Comput. Math. Model."},{"key":"2_CR22","unstructured":"Mansinghka, V., Jonas, E., Tenenbaum, J.: Stochastic Digital Circuits for Probabilistic Inference. Tech. Rep. MIT-CSAIL-TR-2008-069, Massachusetts Institute of Technology, Cambridge, MA, USA (2008)"},{"issue":"1","key":"2_CR23","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1109\/TIT.2014.2370638","volume":"61","author":"A Mozeika","year":"2015","unstructured":"Mozeika, A., Saad, D.: On reliable computation by noisy random Boolean formulas. IEEE Trans. Inf. Theory 61(1), 637\u2013644 (2015)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"2_CR24","volume":"2613","author":"S Nishimura","year":"2023","unstructured":"Nishimura, S.: Classification of sequential circuits as causal functions. J. Phys: Conf. Ser. 2613(1), 012016 (2023)","journal-title":"J. Phys: Conf. Ser."},{"key":"2_CR25","doi-asserted-by":"publisher","DOI":"10.1017\/9781009625715","volume-title":"An Introduction to String Diagrams for Computer Scientists","author":"R Piedeleu","year":"2025","unstructured":"Piedeleu, R., Zanasi, F.: An Introduction to String Diagrams for Computer Scientists, 1st edn. Elements in Applied Category Theory, Cambridge University Press (2025)","edition":"1"},{"key":"2_CR26","doi-asserted-by":"crossref","unstructured":"Pippenger, N.: On networks of noisy gates. In: 26th Annual Symposium on Foundations of Computer Science (SFCS), pp. 30\u201338 (1985)","DOI":"10.1109\/SFCS.1985.41"},{"issue":"13","key":"2_CR27","doi-asserted-by":"publisher","first-page":"1877","DOI":"10.1016\/j.dam.2012.03.039","volume":"160","author":"MD Riedel","year":"2012","unstructured":"Riedel, M.D., Bruck, J.: Cyclic Boolean circuits. Discret. Appl. Math. 160(13), 1877\u20131900 (2012)","journal-title":"Discret. Appl. Math."},{"key":"2_CR28","doi-asserted-by":"crossref","unstructured":"Sprunger, D., Katsumata, S.y.: Differentiable causal computations via delayed trace (extended version). Math. Struct. Comput. Sc. 35, 1\u201335 (2025)","DOI":"10.1017\/S0960129524000331"},{"key":"2_CR29","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1007\/978-3-030-88945-6_12","volume-title":"Logic Functions and Equations: Fundamentals and Applications using the XBOOLE-Monitor","author":"B Steinbach","year":"2022","unstructured":"Steinbach, B., Posthoff, C.: Sequential circuits. In: Steinbach, B., Posthoff, C. (eds.) Logic Functions and Equations: Fundamentals and Applications using the XBOOLE-Monitor, pp. 741\u2013794. Springer, Cham (2022)"},{"issue":"3","key":"2_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1063\/1.4943668","volume":"87","author":"M Stip\u010devi\u0107","year":"2016","unstructured":"Stip\u010devi\u0107, M.: Quantum random flip-flop and its applications in random frequency synthesis and true random number generation. Rev. Sci. Instrum. 87(3), 1\u201318 (2016)","journal-title":"Rev. Sci. Instrum."},{"issue":"1","key":"2_CR31","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1002\/spe.4380090105","volume":"9","author":"DA Turner","year":"1979","unstructured":"Turner, D.A.: A new implementation technique for applicative languages. Software - Practice and Experience 9(1), 31\u201349 (1979)","journal-title":"Software - Practice and Experience"},{"key":"2_CR32","doi-asserted-by":"crossref","unstructured":"Villoria, A., Basold, H., Laarman, A.: Enriching diagrams with algebraic operations. In: 28th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2024). Springer (2025)","DOI":"10.1007\/978-3-031-57228-9_7"},{"key":"2_CR33","doi-asserted-by":"crossref","unstructured":"Wegener, I.: The complexity of Boolean functions. John Wiley & Sons, 1st edn. (1987)","DOI":"10.1007\/3-540-18170-9_185"},{"issue":"1","key":"2_CR34","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1109\/TBCAS.2013.2291398","volume":"8","author":"P Zhu","year":"2014","unstructured":"Zhu, P., Han, J.: Stochastic multiple-valued gene networks. IEEE Trans. Biomed. Circuits Syst. 8(1), 42\u201353 (2014)","journal-title":"IEEE Trans. Biomed. Circuits Syst."}],"container-title":["Lecture Notes in Computer Science","Relational and Algebraic Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-22469-9_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:58:06Z","timestamp":1775055486000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-22469-9_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032224682","9783032224699"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-22469-9_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"2 April 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RAMICS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Relational and Algebraic Methods in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"B\u0119dlewo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 April 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 April 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ramics2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ramics-conf.github.io\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}