Differences
This shows you the differences between two versions of the page.
Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
sequencers [2021/02/17 18:03] admin [Types of Sequencers] |
sequencers [2021/02/17 18:08] admin [Sequencer - Priority Path] |
||
---|---|---|---|
Line 28: | Line 28: | ||
The weight of the outgoing transitions determines the probability a transition will be traversed from its source state. | The weight of the outgoing transitions determines the probability a transition will be traversed from its source state. | ||
- | //Random// sequencer is useful for exploratory type of testing by allowing the model to run for an extended period of time to let the algorithm | + | //Random// sequencer is useful for exploratory type of testing by allowing the model to run for an extended period of time to let the algorithm |
- | //Random// sequencer is also often used for load and stress testing by running model with may //virtual users (VU)// to simulate realistic load of a production systems. | + | //Random// sequencer is also often used for load and stress testing by running model with many //virtual users (VUs)// to simulate realistic load of a production systems. |
- | Another good use of //Random// sequencer is to find memory leak, locking contention, etc. that are caused by running //AUT// over a long period of time. You can just leave the model running with the elapse time stop condition set to desired duration of time. | + | Another good use of //Random// sequencer is to find memory leak, locking contention, etc. that are caused by running //AUT// over a long period of time or under heavy load. You can just leave the model running with the elapse time stop condition set to desired duration of time. |
The disadvantage of //Random// sequencer is that the model coverage is typically time-dependent - it may take longer time for it to achieve the desired model coverage. | The disadvantage of //Random// sequencer is that the model coverage is typically time-dependent - it may take longer time for it to achieve the desired model coverage. | ||
Line 40: | Line 40: | ||
=====Sequencer - Optimal===== | =====Sequencer - Optimal===== | ||
- | //Optimal// sequencer uses uses algorithms | + | //Optimal// sequencer uses the algorithm |
- | The obvious advantage of //Optimal// sequencer is that it generates the least number of steps to cover every transitions in the model. | + | The obvious advantage of //Optimal// sequencer is that it generates the least number of steps to cover all transitions in the model. |
The side effect is that the test cases generated by //Optimal// sequencer tends to be longer and fewer test cases with the minimal total number of test steps. | The side effect is that the test cases generated by //Optimal// sequencer tends to be longer and fewer test cases with the minimal total number of test steps. | ||
Line 51: | Line 51: | ||
// | // | ||
- | The test cases generated by // | + | The test cases generated by // |
// | // |