XDI analysis of Decision-Wait
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 Decision-Wait)
4> (SYMBOLS
5> (a0 INPUT) (a1 INPUT) (b0 INPUT) (b1 INPUT)
6> (c00 OUTPUT) (c10 OUTPUT) (c01 OUTPUT) (c11 OUTPUT)
7> )
8>
9> (STATES
10> (0 INITIAL BOX)
11> (1 BOX)
12> (2 BOX)
13> (3 BOX)
14> (6 BOX)
15> (4 TRANSIENT)
16> (7 TRANSIENT)
17> (5 TRANSIENT)
18> (8 TRANSIENT)
19> )
20> (TRANSITIONS
21> (0 1 a0) (0 2 a1) (0 3 b0) (0 6 b1)
22> (1 4 b0) (1 7 b1)
23> (2 5 b0) (2 8 b1)
24> (3 4 a0) (3 5 a1)
25> (6 7 a0) (6 8 a1)
26> (4 0 c00)
27> (7 0 c01)
28> (5 0 c10)
29> (8 0 c11)
30> )
31> )
32> )
-----------------------------------------------------------------------------
Decision-Wait: warning: interpretation not given. Assuming 'Verhoeff/XDI'
Decision-Wait: 1 warning, 0 errors.
-
- 8 symbols:
- 4 input and 4 output
- 9 states:
- 0 demanding, 5 indifferent and 4 transient
- 16 transitions:
- 12 input and 4 output
Top | Statistics | Automorphisms | Finest Semi-independent Partition | Choice, Order Dependence, Nondeterminism | Distances | Autocomparison | XDI Validity
-
There are 8 automorphisms.
Top | Statistics | Automorphisms | Finest Semi-independent Partition | Choice, Order Dependence, Nondeterminism | Distances | Autocomparison | XDI Validity
-
/ a0 a1 b0 b1 c00 c10 c01 c11 /
Top | Statistics | Automorphisms | Finest Semi-independent Partition | Choice, Order Dependence, Nondeterminism | Distances | Autocomparison | XDI Validity
- Maximally Transient
- Disabling inputs (Zinp) in state(s):
- 0 1 2 3 6
- 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
- All states are reachable from the initial state:
[ + == 9 < distance < +inf , . == distance = +inf ]
Initial state reachable from all states.
All states reachable from all other states.
- Shortest paths from initial state:
-
0: | |
1: | a0 |
2: | a1 |
3: | b0 |
6: | b1 |
4: | a0 b0 |
7: | a0 b1 |
5: | a1 b0 |
8: | a1 b1 |
- Distribution of distances from initial state:
[d=distance, h=occurrence count, c=cumulative occurrence count] -
d: | h | [c] |
0: | 1 | [1] |
1: | 4 | [5] |
2: | 4 | [9] |
Top | Statistics | Automorphisms | Finest Semi-independent 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 Semi-independent Partition | Choice, Order Dependence, Nondeterminism | Distances | Autocomparison | XDI Validity
-
'Decision-Wait' 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.0 (Feb 17 1998 20:34:43)
Copyright © 1995-1997 Eindhoven University of Technology