XDI analysis of Non-receptive Test-and-Set [dial]

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

Processing AND/IF input stream:
-----------------------------------------------------------------------------
  2> (AND/IF_1.0
  3> (NFA 
  4>      (NAME Non-receptive Test-and-Set [dial])
  5>      (INTERPRETATION Verhoeff/XDI)
  6>      (NOTE Generated by digg v1.0)
  7>      (SYMBOLS 
  8>               (r INPUT)
  9>               (t INPUT)
 10>               (a OUTPUT)
 11>               (t0 OUTPUT)
 12>               (t1 OUTPUT)
 13>      )
 14>      (STATES 
 15>         (0 BOX INITIAL)
 16>         (1 TRANSIENT)
 17>         (2 TRANSIENT)
 18>         (3 BOX)
 19>         (4 TRANSIENT)
 20>      )
 21>      (TRANSITIONS
 22>          (0 1 r)
 23>          (0 2 t)
 24>          (1 3 a)
 25>          (2 0 t1)
 26>          (3 4 t)
 27>          (4 0 t0)
 28>      )
 29> ))
-----------------------------------------------------------------------------


Statistics

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


Automorphisms (symmetries)

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


Finest Semi-independent Partition

/ r t a t0 t1 /
Top | Statistics | Automorphisms | Finest Semi-independent Partition | Choice, Order Dependence, Nondeterminism | Distances | Autocomparison | XDI Validity


Choice, Order Dependence, Nondeterminism

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 ]
  01234
0:01123

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

Shortest paths from initial state:
0:
1:
2:
3:r a 
4:r a t 

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:1[4]
3:1[5]
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

'Non-receptive Test-and-Set [dial]' 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)
Copyright © 1995-1997 Eindhoven University of Technology