XDI comparison of Test-and-set and COMP

Processing AND/IF input stream:
-----------------------------------------------------------------------------
  1> (AND/IF_1.0
  2>   (NFA
  3>     (NAME Test-and-set)
  4>     (SYMBOLS 
  5>       (r INPUT) (t INPUT) (t0 OUTPUT) (t1 OUTPUT)
  6>     )
  7> 
  8>     (STATES
  9>       (0 INITIAL BOX)
 10>       (1 BOX)
 11>       (2 TRANSIENT)	
 12>       (3 TRANSIENT)	
 13>     )
 14>     (TRANSITIONS
 15>       (0 1 r) (0 2 t)
 16>       (1 3 t) 
 17>       (2 3 r)
 18>       (2 0 t1)
 19>       (3 0 t0)
 20>       (3 1 t1)
 21>     )
 22>   )
 23> )
-----------------------------------------------------------------------------

Test-and-set: warning: interpretation not given. Assuming 'Verhoeff/XDI'
Test-and-set: 1 warning, 0 errors.

Processing AND/IF input stream:
-----------------------------------------------------------------------------
  1> (AND/IF_1.0
  2> ( NFA 
  3>    ( NAME COMP)
  4>    ( NOTE  Generated by digg v1.0)
  5>    ( INTERPRETATION  Verhoeff/XDI)
  6>      (SYMBOLS
  7>        (t1 OUTPUT)
  8>        (t0 OUTPUT)
  9>        (t INPUT)
 10>        (r INPUT)
 11>       )
 12>      (STATES
 13>         (2 TRANSIENT) 
 14>         (3 BOX) 
 15>         (4 TRANSIENT) 
 16>         (5 BOX INITIAL) 
 17>      )
 18>      (TRANSITIONS 
 19>         (2 5 t1)
 20>         (2 4 r)
 21>         (3 4 t)
 22>         (4 3 t1)
 23>         (4 5 t0)
 24>         (5 2 t)
 25>         (5 3 r)
 26>     )))
-----------------------------------------------------------------------------

AND/IF_1.0
  (NFA
    (NAME Test-and-set)
    (SYMBOLS 
      (r INPUT) (t INPUT) (t0 OUTPUT) (t1 OUTPUT)
    )

    (STATES
  

Alphabets

'Test-and-set' and 'COMP' have comparable alphabets

Joint Reachability

# reachable state pairs = 4
[ + == 9 < distance < +inf , . == distance = +inf ]

	2	3	4	5
0:	.	.	.	0
1:	.	1	.	.
2:	1	.	.	.
3:	.	.	2	.

Shortest distances and paths from initial pair

[(s,t)=state pair, d=distance, X\Y=not indiv. min., path=shortest path]

(s,t):	d,	X\Y,	path
(0,5):	0,	\ ,
(1,3):	1,	\ ,	r
(2,2):	1,	\ ,	t
(3,4):	2,	\ ,	r t

Distribution of distances from initial pair

[d=distance, h=occurrence count, c=cumulative occurrence count]

d:	h	[c]
0:	1	[1]
1:	2	[3]
2:	1	[4]

Comparison

'Test-and-set' refines 'COMP'.

Comparison Matrix:

	2	3	4	5
0:	0	.	0	.
1:	0	.	0	1
2:	.	1	.	1
3:	1	1	.	1

'Test-and-set' is refined by 'COMP'.
Comparison Matrix:

	2	3	4	5
0:	1	1	1	.
1:	1	.	1	.
2:	.	0	1	0
3:	.	0	.	0