Sequencing graph hierarchy

In this section, we further separate the sequencing graph hierarchy into two forms calling hierarchy and control-flow hierarchy. 

Gs root graph Root of sequencing graph hierarchy... 

Synthesis across the hierarchy. As described in Chapter 4, the sequencing graph model supports two forms of hierarchy calling hierarchy, which refos to the nesting structure of model call vertices, and control-flow hierarchy, which refers to the nesting structure of conditionals and loops. 

In general, conditionals and loops are present in the model description, and the cf-hierarchy G m consists of multiple sequencing graphs. Accordingly, the elements of Q CV may reside in different graphs in G j. 

Figure 5.9 Illustrating (a) the cf-hierarchy G f rooted at the sequencing graph Gm- The set Q consists of vertices from the four graphs, Q = vi,. ..vg, (b) corresponding weights.

Theorem 5.2.1 Given a sequencing graph Gm and its cf-hierarchy, the concur-... 

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. 

Precise restarting For all polar sequencing graphs in the hierarchy induced by G, the control element of the source vertex of a given graph is activated in the cycle following the completion of all its vertices. 

---