Differences
This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
sequencers [2024/01/03 20:04] – [Sequencer - Pairwise] admin | sequencers [2024/01/03 21:51] (current) – [Sequencer - AllPairs] admin | ||
---|---|---|---|
Line 63: | Line 63: | ||
// | // | ||
- | =====Sequencer - Mark Optimal===== | ||
- | Often times you may want to only test certain part of the model. | ||
- | //Mark Optimal// sequencer generates the test cases using the same //Postman Problem Algorithm// used by [[# | + | =====Sequencer - Marking States/ |
- | + | With IDE, you can mark (highlight) states and transitions and generate | |
- | //Mark Optimal// sequencer (and [[# | + | |
- | + | ||
- | //Mark Optimal// sequencer is only available when running model in IDE. | + | |
- | =====Sequencer - Mark Serial===== | + | |
- | //Mark Serial// sequencer is similar to [[# | + | |
- | + | ||
- | What distinguishes //Mark Serial// sequencer from //Mark Optimal// sequencer is that the test cases generates follows the order the transitions are marked. | + | |
- | + | ||
- | //Mark Serlia// sequencer (and [[# | + | |
- | + | ||
- | //Mark Serial// sequencer allows you to test scenarios that require traversing transitions in a specific order. | + | |
- | + | ||
- | + | ||
- | //Mark Optimal// sequencer is only available when running model in IDE. | + | |
=====Sequencer - MCase===== | =====Sequencer - MCase===== | ||
Line 89: | Line 73: | ||
Since //MCase// is built with scripting, you can dynamically build any number of //MCases// through //REST// api. This provides an option to allow ALM process to test bug fixes remotely. | Since //MCase// is built with scripting, you can dynamically build any number of //MCases// through //REST// api. This provides an option to allow ALM process to test bug fixes remotely. | ||
- | |||
- | |||
- | =====Sequencer - Concurrent===== | ||
- | // | ||
- | |||
- | ===== Combinatorial Algorithms ===== | ||
- | In the ideal world we would want exhausted testing, but we all know that's not practical and in many cases not feasible. | ||
- | |||
- | // | ||
- | |||
- | * pairwise | ||
- | * 3-wise | ||
- | * 4-wise | ||
- | * 5-wise | ||
- | * 6-wise | ||
- | |||
- | |||
- | Pairwise algorithm geneartes the least number of test cases (permutations of variables) while 6-wise generates the most test cases but provides most coverage among the algorithm listed above. | ||
- | |||
- | Empirically most of defects are caused by the interaction between two variables, hence pairwise algorithm would provide decent coverage with least amount of test cases for most of the system. | ||
- | |||
- | |||