From: On optimal control policy for probabilistic Boolean network: a state reduction approach
 | Size | Cost | CPU Time (sec.) | |||
---|---|---|---|---|---|---|
 | Original | Reduced | Original | Reduced | Original | Reduced |
m= 1 | Â | Â | Â | Â | Â | Â |
N = 2 | 32 | 24 | 17 | 17 | 0.1276 | 0.0943 |
K = 2 | Â | Â | Â | Â | Â | Â |
m= 1 | Â | Â | Â | Â | Â | Â |
N = 2 | 32 | 26 | 5 | 5 | 0.1255 | 0.0997 |
K = 3 | Â | Â | Â | Â | Â | Â |
m = 1 | Â | Â | Â | Â | Â | Â |
N = 4 | 32 | 26 | 21 | 21 | 0.1286 | 0.1062 |
K = 2 | Â | Â | Â | Â | Â | Â |
m = 1 | Â | Â | Â | Â | Â | Â |
N = 4 | 32 | 27 | 19 | 19 | 0.1291 | 0.1085 |
K = 3 | Â | Â | Â | Â | Â | Â |
m = 1 | Â | Â | Â | Â | Â | Â |
N = 8 | 32 | 30 | 25 | 25 | 0.1355 | 0.1274 |
K = 2 | Â | Â | Â | Â | Â | Â |
m = 1 | Â | Â | Â | Â | Â | Â |
N = 8 | 32 | 32 | 29 | 29 | 0.1355 | 0.1355 |
K = 2 | Â | Â | Â | Â | Â | Â |
m = 2 | Â | Â | Â | Â | Â | Â |
N = 2 | 16 | 11 | 9 | 9 | 0.1061 | 0.0692 |
K = 2 | Â | Â | Â | Â | Â | Â |
m = 2 | Â | Â | Â | Â | Â | Â |
N = 2 | 16 | 10 | 3 | 3 | 0.0996 | 0.0585 |
K = 3 | Â | Â | Â | Â | Â | Â |
m = 2 | Â | Â | Â | Â | Â | Â |
N = 4 | 16 | 14 | 9 | 9 | 0.1051 | 0.0996 |
K = 2 | Â | Â | Â | Â | Â | Â |
m = 2 | Â | Â | Â | Â | Â | Â |
N = 4 | 16 | 16 | 6 | 6 | 0.1040 | 0.0997 |
K = 3 | Â | Â | Â | Â | Â | Â |
m = 2 | Â | Â | Â | Â | Â | Â |
N = 8 | 16 | 16 | 14 | 14 | 0.1063 | 0.1050 |
K = 2 | Â | Â | Â | Â | Â | Â |
m = 2 | Â | Â | Â | Â | Â | Â |
N = 8 | 16 | 16 | 12 | 12 | 0.1049 | 0.1053 |
K = 3 | Â | Â | Â | Â | Â | Â |