Skip to main content
. 2015 Mar 19;10(3):e0117519. doi: 10.1371/journal.pone.0117519

Fig 7. The generated reachability graph of the complete discrete Petri Net model.

Fig 7

The order of the tuple in each marking is ⟨CB, SIRT1, PC, Feed, HSF1, PARP1⟩. The graph was generated from the initial marking m 0 = (0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1), shown at the top. It consists of 64 unique markings and 224 marking transitions, and is itself a single strongly connected component.