On serializability of iterated transactions
Marie-Paule Flé, Gérard Roucairol · 1982
In the literature on serializability (see [1]), a transaction is considered to be a finite sequence of operations. As a step towards the handling of more complex evolutions of processes, we assume in this paper that the sequence of operations performed by a transaction may be infinitely often repeated as for instance, might behave a pre-existing service process in an operating system. (Remark that the classical “critical section” problem can be viewed as a particular case of the serializability problem). Therefore, a behaviour of a system of transactions will be understood herein as an infinite behaviour.