XDI analysis of Mixer
Top  Statistics  Automorphisms  Finest Semiindependent Partition  Choice, Order Dependence, Nondeterminism  Distances  Autocomparison  XDI Validity
Processing AND/IF input stream:

1> (AND/IF_1.0
2> (NFA
3> (NAME Mixer)
4> (SYMBOLS
5> (r0 INPUT) (a0 OUTPUT) (r1 INPUT) (a1 OUTPUT)
6> (r OUTPUT) (a INPUT)
7> )
8>
9> (STATES
10> (0 INITIAL BOX)
11> (1 TRANSIENT)
12> (2 TRANSIENT)
13> (3 TRANSIENT)
14> (4 BOX)
15> (5 BOX)
16> (6 BOX)
17> (7 TRANSIENT)
18> (8 TRANSIENT)
19> (9 TRANSIENT)
20> (10 TRANSIENT)
21> (11 TRANSIENT)
22> )
23> (TRANSITIONS
24> (0 1 r0) (0 2 r1)
25> (1 3 r1) (1 4 r)
26> (2 3 r0) (2 5 r)
27> (3 6 r)
28> (4 6 r1) (4 7 a)
29> (5 6 r0) (5 8 a)
30> (6 9 a)
31> (7 0 a0) (7 9 r1)
32> (8 9 r0) (8 0 a1)
33> (9 2 a0) (9 1 a1) (9 10 r)
34> (10 5 a0) (10 4 a1) (10 11 a)
35> (11 8 a0) (11 7 a1)
36> )
37> )
38> )

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

 6 symbols:
 3 input and 3 output
 12 states:
 0 demanding, 4 indifferent and 8 transient
 24 transitions:
 12 input and 12 output
Top  Statistics  Automorphisms  Finest Semiindependent Partition  Choice, Order Dependence, Nondeterminism  Distances  Autocomparison  XDI Validity

0:  r0  a0  r1  a1  r  a 
0:  r1  a1  r0  a0  r  a 
Top  Statistics  Automorphisms  Finest Semiindependent Partition  Choice, Order Dependence, Nondeterminism  Distances  Autocomparison  XDI Validity

/ r0 a0 / r1 a1 / r a /
Top  Statistics  Automorphisms  Finest Semiindependent Partition  Choice, Order Dependence, Nondeterminism  Distances  Autocomparison  XDI Validity
 Maximally Transient
 No Disabling Inputs (Z^{inp})
 Disabling outputs (Z^{out}) in state(s):
 9 10
 OrderIndependent input (Y^{inp})
 OrderIndependent output (Y^{out})
 Output refusal sets do NOT propagate backward over inputs in state(s):
 7 8
 Output NonDeterministic
Top  Statistics  Automorphisms  Finest Semiindependent Partition  Choice, Order Dependence, Nondeterminism  Distances  Autocomparison  XDI Validity
 All states are reachable from the initial state:
[ + == 9 < distance < +inf , . == distance = +inf ]
           1  1 
 0  1  2  3  4  5  6  7  8  9  0  1 
0:  0  1  1  2  2  2  3  3  3  4  5  6 
Initial state reachable from all states.
All states reachable from all other states.
 Shortest paths from initial state:

0:  
1:  r0 
2:  r1 
3:  r0 r1 
4:  r0 r 
5:  r1 r 
6:  r0 r1 r 
7:  r0 r a 
8:  r1 r a 
9:  r0 r1 r a 
10:  r0 r1 r a r 
11:  r0 r1 r a r a 
 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:  3  [ 9] 
4:  1  [10] 
5:  1  [11] 
6:  1  [12] 
Top  Statistics  Automorphisms  Finest Semiindependent Partition  Choice, Order Dependence, Nondeterminism  Distances  Autocomparison  XDI Validity

There are no state pairs (x,y) where x refines y outside the diagonal.
Top  Statistics  Automorphisms  Finest Semiindependent Partition  Choice, Order Dependence, Nondeterminism  Distances  Autocomparison  XDI Validity

'Mixer' is a valid XDI specification.
Top  Statistics  Automorphisms  Finest Semiindependent Partition  Choice, Order Dependence, Nondeterminism  Distances  Autocomparison  XDI Validity
XDI State Graph Tool, Version 2.1.1 (Jun 26 1998 10:51:42)
Copyright © 19951997 Eindhoven University of Technology