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

0 votes
I am struggling to understand the fairness property. I listened to the lecture but because the explanation contains the diagram drawn on board I am not able to understand its intuitive meaning that the professor has explained in the lecture. Can someone please explain. It would be really helpful.
in * TF "Vis. and Sci. Comp." by (870 points)

1 Answer

+1 vote
It is difficult to answer that question without a context. If we speak about mu-calculus, then a fairness property is written as nu y. <>(mu x. (y&phi | <>x)) and denotes the set of states having an outgoing infinite path that visits states of phi infinitely often. Why that is so is not just explained on the black board, but also on slides 38-39 of the mu-calculus chapter.

Talking about omega-automata, we consider as acceptance condition GFphi which means that words are accepted by an existential nondeterministic omega-automaton if they have a run which visits infinitely often states in phi. That in turn can be checked by the mu-calculus property, and is written as GFphi, meaning that always (at any point of time), there must be a future point of time where phi holds. Thus, phi must hold infinitely often.
by (143k points)
Thank you so much

Related questions

0 votes
1 answer
0 votes
1 answer
asked Aug 16, 2020 in * TF "Vis. and Sci. Comp." by Anshu (870 points)
+1 vote
1 answer
Imprint | Privacy Policy
...