{"title":"二元决策图的形式转换技术","authors":"G. Kolotov, I. Levin, V. Ostrovsky","doi":"10.1109/ICECS.2004.1399730","DOIUrl":null,"url":null,"abstract":"Binary decision diagrams (BDDs), when used for the representation of discrete functions, permit the direct technology mapping into multi-level logic networks. Complexity of a network derived from a BDD is expressed by its number of non-terminal nodes. The paper discusses the problem of reducing the BDDs. It makes two main contributions: (a) the bounds of the potential complexity of the BDD are determined and proven; (b) a formal technique is presented for simplification of Boolean operations on a set of BDDs.","PeriodicalId":38467,"journal":{"name":"Giornale di Storia Costituzionale","volume":"15 1","pages":"511-514"},"PeriodicalIF":0.0000,"publicationDate":"2004-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Techniques for formal transformations of binary decision diagrams\",\"authors\":\"G. Kolotov, I. Levin, V. Ostrovsky\",\"doi\":\"10.1109/ICECS.2004.1399730\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Binary decision diagrams (BDDs), when used for the representation of discrete functions, permit the direct technology mapping into multi-level logic networks. Complexity of a network derived from a BDD is expressed by its number of non-terminal nodes. The paper discusses the problem of reducing the BDDs. It makes two main contributions: (a) the bounds of the potential complexity of the BDD are determined and proven; (b) a formal technique is presented for simplification of Boolean operations on a set of BDDs.\",\"PeriodicalId\":38467,\"journal\":{\"name\":\"Giornale di Storia Costituzionale\",\"volume\":\"15 1\",\"pages\":\"511-514\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-12-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Giornale di Storia Costituzionale\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICECS.2004.1399730\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"Arts and Humanities\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Giornale di Storia Costituzionale","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICECS.2004.1399730","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Arts and Humanities","Score":null,"Total":0}
Techniques for formal transformations of binary decision diagrams
Binary decision diagrams (BDDs), when used for the representation of discrete functions, permit the direct technology mapping into multi-level logic networks. Complexity of a network derived from a BDD is expressed by its number of non-terminal nodes. The paper discusses the problem of reducing the BDDs. It makes two main contributions: (a) the bounds of the potential complexity of the BDD are determined and proven; (b) a formal technique is presented for simplification of Boolean operations on a set of BDDs.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
