A Method of Finding a Set of Solutions of Condition/Event Net Construction Problem Using no Auxiliary Events

Abstract

This paper deals with the condition/event net (C/E net) construction problem P_T(X), in which the objective is to synthesize a C/E net to exhibit the desired behavior specified as a partial language X using the only events in X. Since the solution of P_T(X) is not always unique, we must choose the desirable ones among all solutions. This paper first shows that the set of solutions of P_T(X) can be found by solving a system of inequalities with 0-1 variables and 0-1 coefficients. It next presents a method of solving inequalities of this type.