Multiserialization of Iterated Transactions

Abstract The usual criterion of serializability considered in data base systems in order to control the accesses to shared informations by concurrent transactions is generalized in two directions: the transactions can be arbitrarily often iterated, as processes in an operating system, and the notion of serialization is extended in order to control behaviours of concurrent transactions with respect to several independent criteria of serializability. For transaction systems controlled under multiple criteria of serializability, a characterization of deadlock freedom is given. This characterization is shown to be applicable to any mutual exclusion problem.