An Example of the D-method

Step 1 (Generate a spanning tree).

Step 2. (Testing the states)

a-part

a,c,a,reset /* for state 1 */

c,a,b,a,c,a,reset /* for state 2 */

c,b,a,c,a,reset /* for state 3 */

c,a,c,a,reset /* for state 4 */

c,a,a,c,a,reset /* for state 5 */

Step 3.(Testing the transitions)

b-part

a,a,c,a,reset /* for transition (1,1) */

c,a,c,a,reset /* for (1,4) */

c,a,b,a,a,c,a,reset /* for (2,1) */

c,a,b,b,a,c,a,reset /* for (2,3) */

c,b,a,a,c,a,reset /* (3,5) */

c,a,a,c,a,reset /* for (4,5) */

c,b,a,c,a,reset /* for (4,3) */

c,a,b,a,c,a,reset /* for (5,2) */

c,a,c,a,c,a,reset /* for (5,5) */

c,a,a,a,c,a,reset /*for (5,1) */

前一張投影片

下一張投影片

回到第一張投影片

檢視圖形版本