{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T22:56:27Z","timestamp":1773615387489,"version":"3.50.1"},"reference-count":13,"publisher":"Allerton Press","issue":"5","license":[{"start":{"date-parts":[[2011,10,1]],"date-time":"2011-10-01T00:00:00Z","timestamp":1317427200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2011,10,1]],"date-time":"2011-10-01T00:00:00Z","timestamp":1317427200000},"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":["Aut. Conrol Comp. Sci."],"published-print":{"date-parts":[[2011,10]]},"DOI":"10.3103\/s0146411611050038","type":"journal-article","created":{"date-parts":[[2011,11,8]],"date-time":"2011-11-08T12:16:34Z","timestamp":1320754594000},"page":"259-267","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The use of binary decision diagrams for the decomposition of programmable logic arrays"],"prefix":"10.3103","volume":"45","author":[{"given":"P. N.","family":"Bibilo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P. V.","family":"Leonczyk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1627","published-online":{"date-parts":[[2011,11,9]]},"reference":[{"key":"6150_CR1","volume-title":"Logicheskii sintez kaskadnykh skhem","author":"A.D. Zakrevskii","year":"1981","unstructured":"Zakrevskii, A.D., Logicheskii sintez kaskadnykh skhem (Logic Synthesis of Cascade Circuits), Moscow: Nauka, 1981."},{"key":"6150_CR2","volume-title":"Sintez kombinatsionnykh skhem metodami funktsional\u0144oi dekompozitsii","author":"P.N. Bibilo","year":"1987","unstructured":"Bibilo, P.N. and Enin, S.V., Sintez kombinatsionnykh skhem metodami funktsional\u0144oi dekompozitsii (Synthesis of Combination Schemes by Functional Decomposition Methods), Minsk: Nauka i Tekhnika, 1987."},{"key":"6150_CR3","volume-title":"Tablichnye metody dekompozitsii sistem polnost\u00fdu opredelennykh bulevykh funktsii","author":"Yu.V. Pottosin","year":"2006","unstructured":"Pottosin, Yu.V. and Shestakov, E.A., Tablichnye metody dekompozitsii sistem polnost\u00fdu opredelennykh bulevykh funktsii (Tabular Methods of Fully Determined Boolean Function System), Minsk: Belarus. Navuka, 2006."},{"issue":"6","key":"6150_CR4","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1109\/TC.1978.1675141","volume":"27","author":"S.B. Akers","year":"1978","unstructured":"Akers, S.B., Binary Decision Diagrams, IEEE Trans. Comp., C, 1978, vol. 27, no. 6, pp. 509\u2013516.","journal-title":"IEEE Trans. Comp., C"},{"issue":"8","key":"6150_CR5","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"35","author":"R.E. Bryant","year":"1986","unstructured":"Bryant, R.E., Graph-Based Algorithms for Boolean Functions Manipulation, IEEE Trans. Comp., C, 1986, vol. 35,no. 8, pp. 677\u2013691.","journal-title":"IEEE Trans. Comp., C"},{"key":"6150_CR6","doi-asserted-by":"crossref","unstructured":"Bryant, R.E. and Meinel, C., Ordered Binary Decision Diagrams in Logic Synthesis and Verification, Hassoun, S., Sasao, T., and Brayton, R.K., Kluwer Academic, 2002, pp. 285\u2013307.","DOI":"10.1007\/978-1-4615-0817-5_11"},{"key":"6150_CR7","volume-title":"Dekompozitsiya bulevykh funktsii na osnove resheniya logicheskikh uravnenii","author":"P.N. Bibilo","year":"2009","unstructured":"Bibilo, P.N., Dekompozitsiya bulevykh funktsii na osnove resheniya logicheskikh uravnenii (Decomposition of the Boolean Functions on the Basis of Logic Equation Solutions), Minsk: Belarus. Navuka, 2009."},{"key":"6150_CR8","unstructured":"Gol\u2019dberg, E.I., Decomposition of the Programmable Logic Matrices, Preprint of Inst. Tech. Cyber. Acad. Sci. Belarus. SSR, Minsk, 1991, no. 6."},{"key":"6150_CR9","unstructured":"http:\/\/www1.cs.columbia.edu\/~cs4861\/sis\/espresso-examples\/ex\/"},{"key":"6150_CR10","volume-title":"Logicheskoe proektirovanie","author":"N.R. Toropov","year":"1999","unstructured":"Toropov, N.R., Minimization of the Boolean Function Systems in the Class of Normal Forms, in Logicheskoe proektirovanie (Logic Design), Minsk: Inst. Tekhn. Kibern. Nat. Akad. Nauk Belarusi, 1999."},{"key":"6150_CR11","unstructured":"Leonchik, P.V., Minimization of the BooleanFunction Systems in the Class of Normal Forms, Informatika, 2006, no. 1, pp. 88\u201396."},{"key":"6150_CR12","unstructured":"Kardash, S.N., Decomposition of the Boolean Function Systems by Method of Identical Representations, in Proektirovanie sistem logicheskogo upravleniya. Sbor. nauchnykh trudov Inst. tekhn. kibern. Akad. Nauk BSSR (Coll. Papers Inst. Techn. Cyber. Acad. Sci. Belarus. SSR \u201cDesign of Systems of Logic Management\u201d), Minsk, 1986."},{"key":"6150_CR13","unstructured":"Sadnikov, D.V., Development of Tabular Method of Decomposition Entirely-Determined Boolean Function System, Informatika, 2005, no. 2, p. 26."}],"container-title":["Automatic Control and Computer Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.3103\/S0146411611050038.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.3103\/S0146411611050038","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.3103\/S0146411611050038","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.3103\/S0146411611050038.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T21:59:12Z","timestamp":1773611952000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.3103\/S0146411611050038"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,10]]},"references-count":13,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2011,10]]}},"alternative-id":["6150"],"URL":"https:\/\/doi.org\/10.3103\/s0146411611050038","relation":{},"ISSN":["0146-4116","1558-108X"],"issn-type":[{"value":"0146-4116","type":"print"},{"value":"1558-108X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,10]]},"assertion":[{"value":"27 June 2011","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 November 2011","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}