Table A1: Auction State Diagram from StackOverflow

1. The above car auction system (created via the VIN or Vehicle Identification Number) is an example where state transition testing is used. Can you outline (and briefly describe) the minimum transitions to test all states? To simplify the requirements for the solution assume:

   1. You may ignore the concurrent states within the Auction state (treat it as a black box)

   2. You may ignore the initial node and any transition from it. You may ignore the final node, and any transitions leading to it.

   3. You may assume every transition trigger is unique

   4. UPDATE 23/9: Once your transition reaches a terminal state (eg. Rejected) you need to start again from the Created state.

   5. UPDATE 28/9: All assumptions above apply to Q2 and Q3 below too.

2. What if you want to test all transitions? How many transitions would you need?

3. Translate this to a State Table (ref table 4.10 of your textbook) and use this table to identify how many invalid transition tests are possible for this system.

II 1 a