Research Article
Model Checking Temporal Logic Formulas Using Sticker Automata
Table 21
A comparison of power among the various DNA model checking methods (can the method conduct DNA model checking for a given formula?).
| Logic | Basic formula | Method in [53] | Method in [55] | Method in [54] | The new method | What the new method can do |
| LTL | pUq | No | Yes | Yes | No | — | Fp | No | Yes | The method can be used to check. However, it is not practical to check due to the limitation of the code | No | — | Gp | No | Yes | The method can be used to check. However, it is not practical to check due to the limitation of the code | No | — | Xp | No | Yes | No | No | — |
| CTL | ApUq | No | No | No | Yes | A combination of Algorithm 1 and the experiments in [55] | AFp | No | No | No | Yes | AGp | No | No | No | Yes | AXp | No | No | No | Yes | EpUq | No | No | No | Yes | The experiments for in Section 4.1 | EFp | Yes | No | No | Yes | A combination of Algorithm 2 and the experiments in [55] | EGp | No | No | No | Yes | EXp | No | No | No | Yes |
| ITL | | No | No | No | Yes | The experiments for in Section 4.2 | | No | No | No | Yes | The experiments for in Section 4.2 |
| PTL | prj | No | No | No | Yes | The experiments for in Section 4.3 |
|
|