Synthesis of Finite State Machines: Functional Optimization
Synthesis of Finite State Machines: Functional Optimization
Solution of parallel language equations for logic synthesis
Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
| Hi-index | 0.00 |
Given a plant MA and a specification MC, the largest solution of the FSM equation M_X\bullet M_A\leqslant M_Ccontains all possible discrete controllers MX. Often we are interested in computing the complete solutions whose composition with the plant is exactly equivalent to the specification. Not every solution contained in the largest one satisfies such property, that holds instead for the complete solutions of the series topology. We study the relation between the solvability of an equation for the series topology and of the corresponding equation for the controllerýs topology. We establish that, if MA is a deterministic FSM, then the FSM equation M_X\bullet M_A\leqslant M_C is solvable for the series topology with an unknown head component if it is solvable for the controllerýs topology. Our proof is constructive, i.e., for a given solution MB of the series topology it shows how to build a solution MD of the controllerýs topology and viceversa.