This problem examines whether the following specifications are satisfiable: i If the file system is not locked, then new messages will be queued. ii If the file system is not locked, then new messages will be sent to the messages buffer. iii If the file system is not locked, then the system is functioning normally, and conversely, if the system is functioning normally, then the file system is not locked. iv If new messages are not queued, then they will be sent to the messages buffer. v New messages will not be sent to the message buffer. 1 Begin by translating the five specifications into Boolean formulas using the four Boolean variables: • L:= file system locked; • Q := new messages are queued; • B:= new messages are sent to the message buffer; • N:= system functioning normally: 2 Demonstrate that this set of specifications is satisfiable by describing a single truth assignment for the variables L, Q,B,N and verifying that under this assignment, all the specifications are true. 3 Argue that the assignment determined in in the previous part is the only one that does the job.

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.