Solutions to the critical section problem exhibit three properties: mutual exclusion, progress, and bounded waiting. When do we say, or do we at least say, that operating system-implemented semaphores and monitors possess all these three properties?
An example would be bounded waiting on semaphores. In bounded semaphores there's a limit on the queue. When the queue is full, is it still safe to say that there is bounded waiting?