Abstract
A Finite State Machine (FSM) decomposition approach is presented combining Algebraic Structure Theory of FSMs and heuristics for state assignment and logic minimization. Parallel and serial decompositions are performed with CAST.FSM by using closed partitions from the lattice of the original FSM and computing component FSMs with symbolic states. State assignment and logic minimization for the component FSMs are performed with CASTOR, JEDI, ESPRESSO and MIS resulting in a two-level and multi-level implementation. Experimental results for MCNC benchmark FSMs are presented. The approach is currently restricted to FSMs with completely specified state transit ion functions.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
