Research Article
Model Checking Temporal Logic Formulas Using Sticker Automata
Algorithm 1
CTLQ-MC-DNA(DNACODE(A), DNACODE(A(
))), the DNA model checking algorithm for the universal CTL formulas.
INPUT: The encoding of one sticker automata for an FSA of a system A and the encoding of the other sticker automaton for | an FSA of a universal CTL formula , where = AU, AF, AG or AX. | OUTPUT: whether A satisfies , or not | BEGIN | Step 1: | SELECT CASE | CASE AU | // where is a formula | CASE AF | // where is a formula | CASE AG | // where is a formula | CASE AX | // where is a formula | ENDSELECT | Step 2: TL-MC-DNA(DNACODE(A), DNACODE(A())) | Step 3: IF = “yes”, THEN return “yes”, ELSE return “no” | END |
|