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 | 12 | 31 | 31 | 0.0402 | 0.0162 |
K = 2 | Â | Â | Â | Â | Â | Â |
m= 1 | Â | Â | Â | Â | Â | Â |
N = 2 | 32 | 23 | 10 | 10 | 0.0375 | 0.0257 |
K = 3 | Â | Â | Â | Â | Â | Â |
m = 1 | Â | Â | Â | Â | Â | Â |
N = 4 | 32 | 28 | 24 | 24 | 0.0396 | 0.0329 |
K = 2 | Â | Â | Â | Â | Â | Â |
m = 1 | Â | Â | Â | Â | Â | Â |
N = 4 | 32 | 30 | 26 | 26 | 0.0386 | 0.0363 |
K = 3 | Â | Â | Â | Â | Â | Â |
m = 1 | Â | Â | Â | Â | Â | Â |
N = 8 | 32 | 32 | 30 | 30 | 0.0402 | 0.0399 |
K = 2 | Â | Â | Â | Â | Â | Â |
m = 1 | Â | Â | Â | Â | Â | Â |
N = 8 | 32 | 32 | 30 | 30 | 0.0419 | 0.0418 |
K = 3 | Â | Â | Â | Â | Â | Â |
m = 2 | Â | Â | Â | Â | Â | Â |
N = 2 | 16 | 12 | 13 | 13 | 0.0315 | 0.0213 |
K = 2 | Â | Â | Â | Â | Â | Â |
m = 2 | Â | Â | Â | Â | Â | Â |
N = 2 | 16 | 15 | 9 | 9 | 0.0277 | 0.0262 |
K = 3 | Â | Â | Â | Â | Â | Â |
m = 2 | Â | Â | Â | Â | Â | Â |
N = 4 | 16 | 14 | 9 | 9 | 0.0300 | 0.0250 |
K = 2 | Â | Â | Â | Â | Â | Â |
m = 2 | Â | Â | Â | Â | Â | Â |
N = 4 | 16 | 16 | 7 | 7 | 0.0293 | 0.0292 |
K = 3 | Â | Â | Â | Â | Â | Â |
m = 2 | Â | Â | Â | Â | Â | Â |
N = 8 | 16 | 16 | 15 | 15 | 0.0316 | 0.0314 |
K = 2 | Â | Â | Â | Â | Â | Â |
m = 2 | Â | Â | Â | Â | Â | Â |
N = 8 | 16 | 16 | 13 | 13 | 0.0316 | 0.0307 |
K = 3 | Â | Â | Â | Â | Â | Â |