Minimum One-Shot State Assignment Using SBDD

スポンサーリンク

概要

• 論文の詳細を見る

• We propose a new method of the one-shot stateassignment for asynchronous sequential machines, in which the propositional calculus, or Boolean algebra is adopted. Exact minimum solutions of the one-shot stateassignment are obtained hy our method for the first time. In order to handle huge propositional formulas,the shared binary decision diagram(SBDD) are used as an internal representation of the formulas. Several solving methods are also proposed to reduce the size of SBDD: applying of coded Boolean variables and filtering functions. Although we succeeded now only in the one shot state assignment for small problems, having new machines capable of handling larger 5BDD, much bigger problems could be solved with this approach. Experimental results show that our method is effective to obtain minimal solutions at significantly reduced computation cost.

• 一般社団法人情報処理学会の論文
• 1992-09-28

著者

• Kwon Yong-jin

  Dept. Of Information Science Faculty Of Engineering Kyoto University

• Yajima Shuzo

  Dept. Of Information Science Faculty Of Engineering Kyoto University

関連論文

• Minimum One-Shot State Assignment Using SBDD

スポンサーリンク