# XDI analysis of Call

Top | Statistics | Automorphisms | Finest Semi-independent Partition | Choice, Order Dependence, Nondeterminism | Distances | Autocomparison | XDI Validity

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

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

```

### Statistics

6 symbols:
3 input and 3 output
12 states:
0 demanding, 4 indifferent and 8 transient
20 transitions:
10 input and 10 output
Top | Statistics | Automorphisms | Finest Semi-independent Partition | Choice, Order Dependence, Nondeterminism | Distances | Autocomparison | XDI Validity

### Automorphisms (symmetries)

  0:  0: a0 a1 b c d0 d1 a1 a0 b c d1 d0
Top | Statistics | Automorphisms | Finest Semi-independent Partition | Choice, Order Dependence, Nondeterminism | Distances | Autocomparison | XDI Validity

### Finest Semi-independent Partition

/ a0 a1 b c d0 d1 /
Top | Statistics | Automorphisms | Finest Semi-independent Partition | Choice, Order Dependence, Nondeterminism | Distances | Autocomparison | XDI Validity

### Choice, Order Dependence, Nondeterminism

• Maximally Transient
• Disabling inputs (Zinp) in state(s):
0 3
• No Disabling Outputs (Zout)
• Order-Independent input (Yinp)
• Order-Independent output (Yout)
• Output refusal sets propate backward over inputs
• Output Deterministic
Top | Statistics | Automorphisms | Finest Semi-independent Partition | Choice, Order Dependence, Nondeterminism | Distances | Autocomparison | XDI Validity

### Distances

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

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

Shortest paths from initial state:
 0: a0 a1 b a0 b a0 c a1 b a1 c a0 b c a0 b d0 a1 b c a0 b d0 b

Distribution of distances from initial state:
[d=distance, h=occurrence count, c=cumulative occurrence count]
d:h[ c]
0:11]
1:34]
2:48]
3:3[11]
4:1[12]
Top | Statistics | Automorphisms | Finest Semi-independent Partition | Choice, Order Dependence, Nondeterminism | Distances | Autocomparison | XDI Validity

### Autocomparison Matrix

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

Top | Statistics | Automorphisms | Finest Semi-independent Partition | Choice, Order Dependence, Nondeterminism | Distances | Autocomparison | XDI Validity

### XDI Validity

'Call' is a valid XDI specification.

Top | Statistics | Automorphisms | Finest Semi-independent Partition | Choice, Order Dependence, Nondeterminism | Distances | Autocomparison | XDI Validity

XDI State Graph Tool, Version 2.1.1 (Jun 26 1998 10:51:42)