A system is in a  state when each process can request available resources without compromising the need for another process(es)

The system is in a "Safe State" when each process can request available resources without compromising the need for another process(es). In a safe state, there are enough resources available for all processes, so no process has to wait indefinitely. This is a key concept in deadlock prevention in operating systems.

Here are the steps to determine if a system is in a safe state:

1. Identify the total resources in the system.
2. Identify the currently allocated resources to each process.
3. Identify the maximum resources each process may request.
4. Calculate the remaining resources (total resources - allocated resources).
5. If the remaining resources can satisfy the maximum demand of at least one process, the system is in a safe state. If not, the system may be in an unsafe state, which could potentially lead to a deadlock.

Remember, being in an unsafe state does not guarantee a deadlock, but it means there's a possibility of one. A system in a safe state guarantees that there is some sequence of processes that can run to completion without causing a deadlock.