Lehrgebiet InformationssystemeFB Informatik | 
  ||
  | 
 | 
||||||||||||||||||||||||||||||||||||||||||||||||||||
| Check | Existing LockRequest[node=CO,lock:SX,PSE:-,NSE:-,FCE:-,LCE:-] with Requested LockRequest[node=CO,lock:SX,PSE:-,NSE:-,FCE:-,LCE:-] on CO  | Requested lock SX on CO incompatible to existing lock SX. | Incompatible | 
| Check | Existing LockRequest[node=CO,lock:SX,PSE:-,NSE:-,FCE:-,LCE:-] with Requested LockRequest[node=NS,lock:-,PSE:EX,NSE:-,FCE:-,LCE:-] on CO  | Compatible | |
| Check | Existing LockRequest[node=CO,lock:SX,PSE:-,NSE:-,FCE:-,LCE:-] with Requested LockRequest[node=PA,lock:-,PSE:-,NSE:-,FCE:EX,LCE:-] on CO  | Compatible | |
| Check | Existing LockRequest[node=NS,lock:-,PSE:EX,NSE:-,FCE:-,LCE:-] with Requested LockRequest[node=CO,lock:SX,PSE:-,NSE:-,FCE:-,LCE:-] on CO  | Compatible | |
| Check | Existing LockRequest[node=NS,lock:-,PSE:EX,NSE:-,FCE:-,LCE:-] with Requested LockRequest[node=NS,lock:-,PSE:EX,NSE:-,FCE:-,LCE:-] on CO  | On NS the previous sibling edge lock EX is incompatible to the requested EX | Incompatible | 
| Check | Existing LockRequest[node=NS,lock:-,PSE:EX,NSE:-,FCE:-,LCE:-] with Requested LockRequest[node=PA,lock:-,PSE:-,NSE:-,FCE:EX,LCE:-] on CO  | Compatible | |
| Check | Existing LockRequest[node=PA,lock:-,PSE:-,NSE:-,FCE:EX,LCE:-] with Requested LockRequest[node=CO,lock:SX,PSE:-,NSE:-,FCE:-,LCE:-] on CO  | Compatible | |
| Check | Existing LockRequest[node=PA,lock:-,PSE:-,NSE:-,FCE:EX,LCE:-] with Requested LockRequest[node=NS,lock:-,PSE:EX,NSE:-,FCE:-,LCE:-] on CO  | Compatible | |
| Check | Existing LockRequest[node=PA,lock:-,PSE:-,NSE:-,FCE:EX,LCE:-] with Requested LockRequest[node=PA,lock:-,PSE:-,NSE:-,FCE:EX,LCE:-] on CO  | On PA the first child edge lock EX is incompatible to the requested EX | Incompatible | 
| Test Case Ok | |||