How to model a transition system with SPIN -

i new spin. want check whether transition system satisfies given ltl property. don't know how model transition system in promela. example, transition system shown below has 2 states, , initial state s0. how check whether ltl property: <>q satisfied. know how describe problem in promela? way, how use next operator of ltl in spin?

you can model automata using labels, atomic blocks , gotos:

bool p, q;  init {     s1:     atomic {       p = true;       q = false;     }     goto s2;    s2:     atomic {       p = false;       q = true;     } } 

to check ltl property, place ltl eventually_q { <>q }; @ end of file , run spin , generated executable -a.

if place property doesn't hold @ end, example, ltl always_p { []p };, you'll message end state in claim reached indicates property has been violated.

about next-operator: in conflict partial order reduction algorithm spin uses per default. properties using next-operator must stutter invariant, otherwise, partial order reduction must disabled. read more @ end of this man page.