摘要
介绍以隐含最大相容类集为基础的经济型状态化简新算法。该算法是从最大隐含相容类集得出最小闭覆盖的初始候选集,通过对初始候选集的不断调整,得到化简结果。通过与一个具有代表性的经济型算法软件的比较发现,用该算法实现的软件,除少数情况外,可对大量状态机进行更有效的状态化简。
his paper presents a new type of economical state drinimization algorithm,based on the set of Implied Maximum Compatibles. First, this algorithm gets theinitial candidate of closed minimum cover from the set of Implied MaximumCompatihbles, and then, by adjusting the initial candidate step by step,gives theminimization result. In comparison with another software implemented with a typicaleconomical algorithm, the new algorithm software can minimize numerous statemachines more efficiently in despite of a few exceptional cases.
出处
《哈尔滨工业大学学报》
EI
CAS
CSCD
北大核心
1996年第2期80-83,共4页
Journal of Harbin Institute of Technology
关键词
时序机
状态化简
逻辑综合
软件
AAMIC算法
Finite state machine
Synchronous sequential machine
State minimization,Logic synthesis