In order to overcome the shortcomings of MIDDs approach proposed by Canh Ngo et al, some improvements are proposed. New graph structures which edge is a tuple of node-variable reduced interval partition and the state value marking critical attribute were designed for the improved MIDDs and X-MIDDs, named iMIDDs and iX-MIDDs respectively. In addition, the combining-algorithm identifier is also added to iX-MIDDs decision-leaf nodes. Operations and processing of policy elements match, policy evaluation, and iMIDD to iX-MIDD transformation are introduced. Complexities analysis and simulation show both space and evaluation time complexities of proposed approach are equivalent to the MIDDs’. New approach could be applied in various policy management problems.
