Issue No. 03 - March (1979 vol. 28)

ISSN: 0018-9340

pp: 238-243

P.L. Hammer , Department of Combinatorics and Optimization, University of Waterloo

ABSTRACT

Given a monotone (nondecreasing) switching function F(x<inf>1</inf>,???,x<inf>n</inf>), its prime implicants are the minimal infeasible points, i.e., the minimal solutions to F(x) = 1. A monotone F is regular ifany "right shift" of a feasible point is again feasible. The roofs of a regular function F are those prime implicants al ofwhose right shifts are feasible. The set of these roofs completely

INDEX TERMS

switching functions, Algorithm, dual, lexicographical ordering, prime implicants, regular, roofs and ceilings

CITATION

U.N. Peled, M.A. Pollatschek, P.L. Hammer, "An Algorithm to Dualize a Regular Switching Function",

*IEEE Transactions on Computers*, vol. 28, no. , pp. 238-243, March 1979, doi:10.1109/TC.1979.1675324