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 | 2048 | 426 | 757 | 757 | 63.84 | 4.07 |
K = 2 | Â | Â | Â | Â | Â | Â |
m = 1 | Â | Â | Â | Â | Â | Â |
N = 2 | 2048 | 700 | 1258 | 1258 | 256.68 | 36.89 |
K = 3 | Â | Â | Â | Â | Â | Â |
m = 1 | Â | Â | Â | Â | Â | Â |
N = 4 | 2048 | 502 | 1830 | 1830 | 272.27 | 23.27 |
K = 2 | Â | Â | Â | Â | Â | Â |
m = 1 | Â | Â | Â | Â | Â | Â |
N = 4 | 2048 | 1462 | 1591 | 1591 | 264.39 | 143.48 |
K = 3 | Â | Â | Â | Â | Â | Â |
m = 1 | Â | Â | Â | Â | Â | Â |
N = 8 | 2048 | 1103 | 2036 | 2036 | 279.58 | 88.80 |
K = 2 | Â | Â | Â | Â | Â | Â |
m = 1 | Â | Â | Â | Â | Â | Â |
N = 8 | 2048 | 1801 | 1987 | 1987 | 272.35 | 243.79 |
K = 3 | Â | Â | Â | Â | Â | Â |
m = 2 | Â | Â | Â | Â | Â | Â |
N = 2 | 1024 | 350 | 607 | 607 | 153.85 | 24.35 |
K = 2 | Â | Â | Â | Â | Â | Â |
m = 2 | Â | Â | Â | Â | Â | Â |
N = 2 | 1024 | 444 | 179 | 179 | 148.80 | 36.10 |
K = 3 | Â | Â | Â | Â | Â | Â |
m = 2 | Â | Â | Â | Â | Â | Â |
N = 4 | 1024 | 415 | 342 | 342 | 140.62 | 29.49 |
K = 2 | Â | Â | Â | Â | Â | Â |
m = 2 | Â | Â | Â | Â | Â | Â |
N = 4 | 1024 | 801 | 328 | 328 | 150.21 | 107.27 |
K = 3 | Â | Â | Â | Â | Â | Â |
m = 2 | Â | Â | Â | Â | Â | Â |
N = 8 | 1024 | 759 | 736 | 736 | 146.98 | 87.76 |
K = 2 | Â | Â | Â | Â | Â | Â |
m = 2 | Â | Â | Â | Â | Â | Â |
N = 8 | 1024 | 937 | 756 | 756 | 172.93 | 146.29 |
K = 3 | Â | Â | Â | Â | Â | Â |