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

912 questions

1k answers

1.4k comments

441 users

0 votes

How can we solve such a question. I'm clueless :(

in * TF "Emb. Sys. and Rob." by (1.7k points)

1 Answer

0 votes
The translation is described on slides 71-75; examples are given on slides 76-79; and the correctness proof is given on slides 61-70. Have a look at that.

In a nutshell: The idea is to abbreviate sub formulas starting with a temporal logic operator with a new state variable of the automaton; and these abbreviations become then a part of the transition relation and yield a fairness constraint.
by (142k points)

Related questions

0 votes
1 answer
0 votes
1 answer
0 votes
1 answer
0 votes
1 answer
Imprint | Privacy Policy
...