XDI analysis of One-All

Processing AND/IF input stream:
-----------------------------------------------------------------------------
  1> (AND/IF_1.0
  2>   (NFA
  3>     (NAME One-All)
  4>     (SYMBOLS 
  5>       (a INPUT) (b INPUT) (c OUTPUT) (d OUTPUT)
  6>     )
  7> 
  8>     (STATES
  9>       (0 INITIAL BOX)
 10>       (1 TRANSIENT)
 11>       (2 TRANSIENT)
 12>       (3 TRANSIENT)
 13>       (4 BOX)
 14>       (5 BOX)
 15>       (6 TRANSIENT)
 16>       (7 TRANSIENT)
 17>     )
 18>     (TRANSITIONS
 19>       (0 1 a) (0 2 b)
 20>       (1 3 b) (1 4 c)
 21>       (2 3 a) (2 5 c)
 22>       (3 6 c) (3 7 d)
 23>       (4 6 b)
 24>       (5 6 a)
 25>       (6 0 d)
 26>       (7 0 c)
 27>     )
 28>   )
 29> )
-----------------------------------------------------------------------------

One-All: warning: interpretation not given. Assuming 'Verhoeff/XDI'
One-All: 1 warning, 0 errors.

Statistics

4 symbols:

2 input and 2 output

8 states:

0 demanding, 3 indifferent and 5 transient

12 transitions:

6 input and 6 output

Automorphisms (symmetries)

0:	a	b	c	d
0:	b	a	c	d

Finest Semi-independent Partition

/ a b c d /

Choice, Order Dependence, Nondeterminism

• Maximally Transient
• No Disabling Inputs (Z^inp)
• No Disabling Outputs (Z^out)
• Order-Independent input (Y^inp)
• Order-Independent output (Y^out)
• Output refusal sets propate backward over inputs
• Output Deterministic

Distances

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

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

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

Shortest paths from initial state:

0:
1:	a
2:	b
3:	a b
4:	a c
5:	b c
6:	a b c
7:	a b d

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:	2	[8]

Autocomparison Matrix

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

XDI Validity

'One-All' is a valid XDI specification.