0
$\begingroup$

Can someone explain the transition function in the below omega automata in the image along with the diagram? It's getting very tough for me to understand this. What I understood till now is that:

  • If "a" is true, the next state of "p" will be true, regardless of the current state of "p".
  • If "q" is true, the next state of "q" will be the negation of "b" and the next state of "q" will be the same as the next state of "q".

enter image description here

$\endgroup$
1
  • $\begingroup$ You should clarify your terminology and notation and possibly give a precise reference. Apparently, you are using model checking techniques to convert temporal logic formulas into automata on infinite words, but you should carefully explain how. $\endgroup$
    – J.-E. Pin
    Feb 1 at 10:47

0

Reset to default

You must log in to answer this question.

Browse other questions tagged .