Skip to main content

Table 7 A 12-Node Example for PBN With Random Perturbation

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

363

1906

1906

18.19

0.89

K = 2

      

m = 1

      

N = 2

2048

867

322

322

17.99

3.75

K = 3

      

m = 1

      

N = 4

2048

581

2005

2005

18.27

1.92

K = 2

      

m = 1

      

N = 4

2048

1340

1931

1931

18.27

8.35

K = 3

      

m = 1

      

N = 8

2048

830

1990

1990

18.42

3.59

K = 2

      

m = 1

      

N = 8

2048

1882

1847

1847

18.38

15.86

K = 3

      

m = 2

      

N = 2

1024

204

286

286

9.67

0.67

K = 2

      

m = 2

      

N = 2

1024

508

153

153

9.60

2.81

K = 3

      

m = 2

      

N = 4

1024

384

242

242

9.63

1.78

K = 2

      

m = 2

      

N = 4

1024

785

486

486

9.69

6.09

K = 3

      

m = 2

      

N = 8

1024

747

839

839

9.91

5.68

K = 2

      

m = 2

      

N = 8

1024

992

611

611

9.87

9.26

K = 3

     Â