Analysis of minimal path and cut vectors in multistate monotone systems and use it for detection of binary type multistate monotone systems

Abstract

Theorem specifying how all minimal cut (path) vectors to level j can be obtained from all minimal path (cut) vectors to level j in any multistate monotone system is proven. Characterizations of binary type multistate monotone systems and binary type multistate strongly coherent systems by minimal cut and path vectors and corresponding to them, binary type cut and path sets are also demonstrated.