Reduction Procedure includes:
Reduction Procedure Algorithm
Cross-Term Step (Step 4)
Parallel Term, (Step 6)
Loop Term (Step 7)
Reduction Procedure Algorithm:
For converting a flow graph links (which has no names) into a path expression that denotes the set of all entry/exit paths in that flow graph, a reduction procedure known as node-by-node removal algorithm is discussed in this section
The below given are the steps in reduction algorithm:
Step 3:
Remove all self-loops (from any node to itself) by replacing them with a link of the form X*, where X is the path expression of the link in that loop
Steps 4-8 are in the algorithm's Loop
Step 4:
Other than the initial or final nodes select any node for removal. Substitute it with a set of equivalent links whose path expression correspond to all the ways you can form a product of the set of inlinks with the set of outlinks of that node
Step 4:
Other than the initial or final nodes select any node for removal. Substitute it with a set of equivalent links whose path expression correspond to all the ways you can form a product of the set of inlinks with the set of outlinks of that node
Step 5: Repeat Step-1
Step 6: Repeat Step-2
Step 7: Repeat Step-3
Step 8:
Does the graph consist of a single link between the entry node and the exit node? If yes, then the path expression for that link is a path expression for the original flow graph, otherwise, return to step 4
Step 6: Repeat Step-2
Step 7: Repeat Step-3
Step 8:
Does the graph consist of a single link between the entry node and the exit node? If yes, then the path expression for that link is a path expression for the original flow graph, otherwise, return to step 4
0 comments:
Post a Comment