Research Article
Model Checking Temporal Logic Formulas Using Sticker Automata
Table 9
The model checking results:
and the basic CTL formulas (whether or not the system
satisfies these formulas).
| | Formula | Result | The used algorithm and decision basis |
| | AU | No | TL-MC-DNA determines that does not satisfy U, and thus Algorithm 1 determines that does not satisfy AU | | AF | Yes | TL-MC-DNA determines that satisfies F, and thus Algorithm 1 determines that satisfies AF | | AG | No | TL-MC-DNA determines that does not satisfy G, and thus Algorithm 1 determines that does not satisfy AG | | AX | No | TL-MC-DNA determines that does not satisfy X, and thus Algorithm 1 determines that does not satisfy AX | | EU | No | Extended TL-MC-DNA determines that satisfies , and thus Algorithm 2 determines that does not satisfy EU | | EF | Yes | TL-MC-DNA determines that does not satisfy Gp, and thus Algorithm 2 determines that satisfies EF | | EG | No | TL-MC-DNA determines that satisfies Fp, and thus Algorithm 2 determines that does not satisfy EG | | EX | No | TL-MC-DNA determines that satisfies Xp, and thus Algorithm 2 determines that does not satisfy EX |
|
|
