XDI analysis of OR-element

Processing AND/IF input stream:
-----------------------------------------------------------------------------
  1> (AND/IF_1.0
  2>   (NFA
  3>     (NAME OR-element)
  4>     (INTERPRETATION Verhoeff/XDI)
  5>     (SYMBOLS 
  6>       (a0 INPUT)
  7>       (b1 INPUT)
  8>       (c1 INPUT)
  9>       (a1 OUTPUT)
 10>       (b0 OUTPUT)
 11>       (c0 OUTPUT)
 12>     )
 13>     (STATES
 14>       (0 INITIAL BOX)
 15>       (1 TRANSIENT)
 16>       (2 BOX)
 17>       (3 BOX)
 18>       (4 TRANSIENT)
 19>     )
 20>     (TRANSITIONS
 21>       (0 1 a0)
 22>       (1 2 b0)
 23>       (1 3 c0)
 24>       (2 4 b1)
 25>       (3 4 c1)
 26>       (4 0 a1)
 27>     )
 28>   )
 29> )
-----------------------------------------------------------------------------

Statistics

6 symbols:

3 input and 3 output

5 states:

0 demanding, 3 indifferent and 2 transient

6 transitions:

3 input and 3 output

Automorphisms (symmetries)

0:	a0	b1	c1	a1	b0	c0
0:	a0	c1	b1	a1	c0	b0

Finest Semi-independent Partition

/ a0 a1 / b1 b0 / c1 c0 /

Choice, Order Dependence, Nondeterminism

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

  1

• Order-Independent input (Y^inp)
• Order-Independent output (Y^out)
• Output refusal sets propate backward over inputs
• Output Non-Deterministic (static)

Distances

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

	0	1	2	3	4
0:	0	1	2	2	3

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

Shortest paths from initial state:

0:
1:	a0
2:	a0 b0
3:	a0 c0
4:	a0 b0 b1

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

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

Autocomparison Matrix

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

XDI Validity

'OR-element' is a valid XDI specification.