0 votes

Hello all,

Can someone help me with the procedure to draw the automata from the formula in the screenshot?

Thanks in advance.

in * TF "Intelligent Systems" by (640 points)

1 Answer

+1 vote
 
Best answer

You just have to determine the satisfying assignments of the transition relation. Why not using the teaching tool https://es.cs.uni-kl.de/tools/teaching/SymbolicStateTrans.html with the following inputs to double-check your result?

    state variables      : p;q    
    input variables      : a 
    initial states       : !p&q
    transition relation  : (p -> a & next(p)) & !b & q & next(q)
    state set            : false
by (91.8k points)
selected by

Related questions

0 votes
1 answer
0 votes
1 answer
asked Aug 11, 2020 in * TF "Intelligent Systems" by malaMahadevu (350 points)
0 votes
1 answer
0 votes
1 answer
asked Aug 12, 2020 in * TF "Vis. and Sci. Comp." by Anshu (870 points)
0 votes
1 answer
asked Feb 5 in * TF "Emb. Sys. and Rob." by dn (1.4k points)
Imprint | Privacy Policy
...