Model Checking Temporal Logic Formulas Using Sticker Automata

Figure 8

Principle of the model checking algorithms based on DNA computing [55].

(a) DNA molecules characterizing run of systematic FSA (i.e., the class I molecules)

(b) Three kinds of DNA molecules characterizing FSA of formula (i.e., the class II molecules)

(c) A complete double strand is formed after hybridization if a run is accepted by the FSA model of formula where DNA molecule 1 is a class I molecule and DNA molecules 2, 3, 4, and 5 are class II molecules

(d) An incomplete double strand is formed after hybridization if a run cannot be accepted by the FSA model of formula where DNA molecule 1 is a class I molecule and DNA molecules 2, 3, 4, and 5 are class II molecules

(e) Flowchart of the algorithms