Research Article
Model Checking Temporal Logic Formulas Using Sticker Automata
Table 5
Checking for
: the encoding rules of input strings characterizing runs, encoding by the way of sticker automata.
| Object of code | DNA code |
| Initiator sequence | I1 = 5′ GCCA 3′ | Spacer sequence | = 5′ GAA 3′, X1 = 5′ TTG 3′, X2 = 5′ CAA 3′, X3 = 5′ GGC 3′ | Terminator sequence | I2 = 5′ CGTC 3′ | Atomic proposition | p = 5′ CGA 3′, q = 5′ CCC 3′, r = p = 5′ CGC 3′, s = q = 5′ AGC 3′, = 5′ GCG 3′ |
|
|