XDI analysis of RGDA Arbiter

Processing AND/IF input stream:
-----------------------------------------------------------------------------
  1> (AND/IF_1.0
  2>   (NFA
  3>     (NAME RGDA Arbiter)
  4>     (SYMBOLS 
  5>       (r0 INPUT) (g0 OUTPUT) (d0 INPUT) (a0 OUTPUT)
  6>       (r1 INPUT) (g1 OUTPUT) (d1 INPUT) (a1 OUTPUT)
  7>     )
  8> 
  9>     (STATES
 10>       (0 INITIAL BOX)
 11>       (1 TRANSIENT)
 12>       (4 TRANSIENT)
 13>       (2 BOX)
 14>       (5 TRANSIENT)
 15>       (3 TRANSIENT)
 16>       (6 BOX)
 17>       (7 TRANSIENT)
 18>       (8 BOX)
 19>       (9 BOX)
 20>       (10 TRANSIENT)
 21>       (11 TRANSIENT)
 22>       (12 TRANSIENT)
 23>       (14 TRANSIENT)
 24>       (13 TRANSIENT)
 25>     )
 26>     (TRANSITIONS
 27>       (0 1 r0) (0 4 r1)
 28>       (1 2 g0) (1 5 r1)
 29>       (4 5 r0) (4 8 g1)
 30>       (2 3 d0) (2 6 r1)
 31>       (5 6 g0) (5 9 g1)
 32>       (3 0 a0) (3 7 r1)
 33>       (6 7 d0)
 34>       (7 4 a0) (7 10 g1)
 35>       (8 9 r0) (8 11 d1)
 36>       (9 12 d1)
 37>       (10 8 a0) (10 14 d1)
 38>       (11 12 r0) (11 0 a1)
 39>       (12 13 g0) (12 1 a1)
 40>       (14 11 a0) (14 3 a1)
 41>       (13 14 d0) (13 2 a1)
 42>     )
 43>   )
 44> )
-----------------------------------------------------------------------------

RGDA Arbiter: warning: interpretation not given. Assuming 'Verhoeff/XDI'
RGDA Arbiter: 1 warning, 0 errors.

Statistics

8 symbols:

4 input and 4 output

15 states:

0 demanding, 5 indifferent and 10 transient

28 transitions:

14 input and 14 output

Automorphisms (symmetries)

There are 2 automorphisms.

Finest Semi-independent Partition

/ r0 a0 / g0 d0 / r1 a1 / g1 d1 /

Choice, Order Dependence, Nondeterminism

• Maximally Transient
• No Disabling Inputs (Z^inp)
• Disabling outputs (Z^out) in state(s):

  5

• Order-Independent input (Y^inp)
• Order-Independent output (Y^out)
• Output refusal sets do NOT propagate backward over inputs in state(s):

  1 4

• Output Non-Deterministic

Distances

All states are reachable from the initial state:
[ + == 9 < distance < +inf , . == distance = +inf ]

											1	1	1	1	1
	0	1	4	2	5	3	6	7	8	9	0	1	2	4	3
0:	0	1	1	2	2	3	3	4	2	3	5	3	4	6	5

Initial state reachable from all states.
All states reachable from all other states.

Shortest paths from initial state:

0:
1:	r0
4:	r1
2:	r0 g0
5:	r0 r1
3:	r0 g0 d0
6:	r0 g0 r1
7:	r0 g0 d0 r1
8:	r1 g1
9:	r0 r1 g1
10:	r0 g0 d0 r1 g1
11:	r1 g1 d1
12:	r0 r1 g1 d1
14:	r0 g0 d0 r1 g1 d1
13:	r0 r1 g1 d1 g0

Distribution of distances from initial state:
[d=distance, h=occurrence count, c=cumulative occurrence count]

d:	h	[ c]
0:	1	[ 1]
1:	2	[ 3]
2:	3	[ 6]
3:	4	[10]
4:	2	[12]
5:	2	[14]
6:	1	[15]

Autocomparison Matrix

There are no state pairs (x,y) where x refines y outside the diagonal.

XDI Validity

'RGDA Arbiter' is a valid XDI specification.