Here you can ask questions and find or give answers to organizational, academic and other questions about studying computer science.

928 questions

1k answers

1.4k comments

441 users

+1 vote
In question 7 b) of 2018 paper, we see a task of computing product structure of two Kripke structures and then checking acceptance condition. How to check this condition in the final Kripke?
in * TF "Emb. Sys. and Rob." by (350 points)

1 Answer

+3 votes

see the following slide from the chapter on omega-automata:

slide 101 of omega-automata chapter

by (143k points)
Thank you sir.
Maybe a remark should be added here, that the bullet point given in red color above refers to the the conversion of MSO to ω-automata (the slide has been taken here out of its context). Translating LTL to ω-automata can be done more efficiently.

Related questions

Imprint | Privacy Policy
...