Candidate operation set

To address this issue, conflict resolution for an instance operation set G(t,<) in a sequencing graph Gm is performed hierarchically in a bottom-up manner. A candidate operation set 0(t,)(G) for each graph G in the cf-hierarchy G m is... 

We consider in the rest of this chapter a single constraint graph model G that is derived from a sequencing graph with timing constraints, wh e conflict resolution has been performed on all graphs in its cf-hierarchy G. Therefore, the term instance operation set in the sequel refers to the candidate operation set of with respect to G. 

The objective in conflict resolution is to resolve the conflicts among elements of a candidate operation set 0(t,)(G), which is derived from a resource binding / and a constraint graph model G V, E). An ordering of the instance operation set is defined as follows. 

---