Relaxed serializability based on consistent states for real-time database applications

Serializability, the standard notion of correctness, has limitations in real-time database systems because its strict logical consistency. For certain real-time applications, serializability may not be necessary for concurrent execution and different correctness criteria may be applied to different applications depending on the semantics and the requirements of transactions in the applications. The authors propose relaxed serializability, called statewise serializability, which extends the correctness criteria beyond view serializability and conflict serializability. It alleviates the strictness of serializability by allowing for a controlled inconsistent read operation. They also present the algorithm that determines whether the schedules are statewise serializable. It can be properly used as a correctness criterion in real-time database applications.