Minimizing the Boolean Function System Oriented Toward Self-Checking Finite-State Machine Design
A. Y. Matrosova, V. V. Andreeva
Pages: 100-111
Abstract
Minimization of a partially monotone function system describing the finite-state machine (FSM) behavior is considered. A notion of a prime system implicant with maximal characteristics is introduced. It is proved that the shortest irredundant sum of the implicants is a union of the shortest irredundant sums of implicants with the same characteristics. In all implicants, the literals corresponding to the state variables have no inversions. The shortest irredundant sum of the implicants is used for FSM self-checking design.
|
