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

1.1k questions

1.2k answers

1.6k comments

531 users

0 votes

For the Problem 6a in Feb 2022 exam, the solution(solution link) gives only two acceptance condition , while I am getting 3(as shown in the picture), how to eliminate the acceptance conditions?
 

  

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

1 Answer

0 votes
This is explained on page 94 in the temporal logic chapter: we can neglect the fairness constraint for positive occurrences of weak operators and we can neglect the fairness constraint for negative occurrences of strong operators.
by (166k points)
Thank you for the response, I tried looking at and understanding the slide page, but did not understand how to identify negative occurrence  or positive occurrence of an operator, can you please explain the same if possible ?
A positive occurrence is one that occurs behind an even number of negations, while a negative occurrence is one that occurs behind an odd number of negations (if we just consider negation, conjunction, and disjunction). Moreover, one has to be careful with the before operators since they also change the sign of occurrences of one of their arguments.
Imprint | Privacy Policy
...