A Snap Judgment Algorithm For Feasible Interactions Based On Hasse Diagram In Bip

The feasible interactions can be obtains by a formal description that the polynomial of The Algebra of Interactions represents a set of feasible interactions; and vice-versa. Hence, a graphic method for feasible interactions is provided by construction of Hasse Diagram in component. It can be described as a tree, having feasible interactions at their leaves. A feasible interaction can be described by an arbitrary path from start node to any shadow node by construction algorithm of Hasse Diagram based on Partially-Ordered. Meanwhile, a snap judgment algorithm is provided for feasible interactions, avoiding inefficiency of state transition through the enumeration method to verify legitimacy of any interactions. Some examples are illustrated applications of description and judgment for feasible interactions, which verifies the availability and intuitiveness of the proposed algorithm.