The problem for Computing the Shortest UIO Sequence
1. A PS-Complete problem.
(See STOC’91, Testing finite State Machines)
2. Solved in O(n2(dmax)2*n*n+2
(See k. Sabnanl and A. Dahbura,”a protocol test generation procedure,” Computer Network and ISDN Systems. vol, 15,1988,pp.285-297