| Require: |
| FSM with states in which is the initial state; |
| Set of non-invertible transitions ; |
| Set of maximum-length IDOSs ; |
| Set of end states for non-invertible transitions ; |
| UIO sequences of ; |
| A minimum-length UIO sequence of ; |
| Ensure: |
| Reduced test sequence of ; |
| (1)if is an with non-invertible transitions then |
| (2)for i=1 to m do |
| (3) where denotes a non-invertible transition; |
| (4); |
| (5) where denotes the end state of ; |
| (6)end for |
| (7)for each state whose out-degree in-degree in do |
| (8)= where is a maximum-length IDOS of transitions generated from the state; |
| (9)= (); |
| (10)end for |
| (11)for each connected component with Euler tours do |
| (12)if States in can be found in an Euler tour with |
| transitions then |
| (13)Choose a state in as the initial state of ; |
| (14)end if |
| (15)=; |
| (16)= (); |
| (17)end for |
| (18)=; |
| (19)Concatenate non-invertible transitions and maximum-length IDOSs as long as the |
| former’s end state is the latter’s start state; |
| (20) where is a new state set; |
| (21) where is a new transition set; |
| (22) where is a new transition set; |
| (23)Construct a minimum-length rural postman tour over in the augmented and extract a |
| test sequence starting from ; |
| (24)Remove the transition sequence follows the UIO sequence of the maximum-length IDOS which |
| is verified last in the minimum-length tour; |
| (25)else |
| (26)if is a symmetric FSM with only invertible transitions then |
| (27) where is an Euler tour starting from and ending at ; |
| (28); |
| (29)else |
| (30)execute lines through ; |
| (31)Execute lines through ; |
| (32)end if |
| (33)end if |
