Differences

This shows you the differences between two versions of the page.

--- wiki:news:3jan2012 [2012/10/22 21:20] – created pmueller
+++ wiki:news:3jan2012 [2012/10/22 21:46] (current) – pmueller
@@ Line 12: / Line 12: @@
 ==== New test case generation algorithm ====
-So far the code generator used a "depth first" method to find test routes (call the codegen using option -c). The used algorithm generates test routes that are as long as possible. The benefit is that usually fewer but longer routes are generated. The figure on the right shows the  PLC Open Safety Block test routes as a tree. You can see how deep this tree is which corresponds to the longest test route.
+So far the code generator used a "depth first" method to find test routes (call the codegen using option -c). The used algorithm generates test routes that are as long as possible. The benefit is that usually fewer but longer routes are generated. The figure on the right shows the [[wiki:examples:plcopen_function_block|Safety Function Block]] test routes as a tree. You can see how deep this tree is which corresponds to the longest test route.
 {{ :wiki:news:news_2_7_ea_equivalent_sc_c.jpg?nolink |Depth first algorithm}}
-An additional new algorithms is available now (call the codegen using option -c1). It uses a 'breadth first' algorithm to find test routes. It begins also at the init state and explores all the neighboring states first. Then for each of those nearest states, it explores their unexplored neighbor states, and so on, until 100% transition coverage was reached. The result are shorter but typically more test routes. The following tree shows again the PLC Open Safety Block test tree but now generated using the new algorithm. You can see that the tree is much broader - i.e. there are more test routes to go. But at the same time the routes are much shorter.
+An additional new algorithms is available now (call the codegen using option -c1). It uses a 'breadth first' algorithm to find test routes. It begins also at the init state and explores all the neighboring states first. Then for each of those nearest states, it explores their unexplored neighbor states, and so on, until 100% transition coverage was reached. The result are shorter but typically more test routes. The following tree shows again the [[wiki:examples:plcopen_function_block|PLC Open Safety Block]] test tree but now generated using the new algorithm. You can see that the tree is much broader - i.e. there are more test routes to go. But at the same time the routes are much shorter.
 {{ :wiki:news:news_2_7_ea_equivalent_sc_c1.jpg?nolink |Breadth first algorithm}}