XDI analysis of Latch

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

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

Statistics

5 symbols:

3 input and 2 output

6 states:

0 demanding, 4 indifferent and 2 transient

9 transitions:

7 input and 2 output

Automorphisms (symmetries)

There are 2 automorphisms.

Finest Semi-independent Partition

/ a0 a1 b c0 c1 /

Choice, Order Dependence, Nondeterminism

• Maximally Transient
• Disabling inputs (Z^inp) in state(s):

  0 3

• 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
0:	0	1	1	1	2	2

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

Shortest paths from initial state:

0:
1:	a0
2:	a1
3:	b
4:	a0 b
5:	a1 b

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

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

Autocomparison Matrix

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

XDI Validity

'Latch' is a valid XDI specification.