XDI analysis of Passivator
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 Passivator)
5> (INTERPRETATION Verhoeff/XDI)
6> (NOTE Generated by digg v1.0)
7> (SYMBOLS
8> (a0 INPUT)
9> (b0 INPUT)
10> (a1 OUTPUT)
11> (b1 OUTPUT)
12> )
13> (STATES
14> (0 TRANSIENT INITIAL)
15> (1 TRANSIENT)
16> (2 TRANSIENT)
17> (3 TRANSIENT)
18> (4 BOX)
19> (5 BOX)
20> (6 BOX)
21> (7 TRANSIENT)
22> )
23> (TRANSITIONS
24> (0 1 a1)
25> (0 2 b1)
26> (1 7 a0)
27> (1 4 b1)
28> (2 3 b0)
29> (2 4 a1)
30> (3 6 a1)
31> (4 5 a0)
32> (4 6 b0)
33> (5 0 b0)
34> (6 0 a0)
35> (7 5 b1)
36> )
37> ))
-----------------------------------------------------------------------------
-
- 4 symbols:
- 2 input and 2 output
- 8 states:
- 0 demanding, 3 indifferent and 5 transient
- 12 transitions:
- 6 input and 6 output
Top | Statistics | Automorphisms | Finest Semi-independent Partition | Choice, Order Dependence, Nondeterminism | Distances | Autocomparison | XDI Validity
-
There are 2 automorphisms.
Top | Statistics | Automorphisms | Finest Semi-independent Partition | Choice, Order Dependence, Nondeterminism | Distances | Autocomparison | XDI Validity
-
/ a0 a1 / b0 b1 /
Top | Statistics | Automorphisms | Finest Semi-independent Partition | Choice, Order Dependence, Nondeterminism | Distances | Autocomparison | XDI Validity
- Maximally Transient
- No Disabling Inputs (Zinp)
- 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: | a1 |
2: | b1 |
3: | b1 b0 |
4: | a1 b1 |
5: | a1 a0 b1 |
6: | a1 b1 b0 |
7: | a1 a0 |
- 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: | 2 | [8] |
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
-
'Passivator' 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