Maximal serializability of iterated transactions
type: Item
instance of: scholarly article
title: Maximal serializability of iterated transactions
zbMATH Open document ID: 0572.68082
DOI: 10.1016/0304-3975(85)90206-3
author: G. Roucairol
author: Marie-Paule Flé
published in: Theoretical Computer Science
publication date: 1985-01-01T00:00:00Z
review text: The serializability condition is usually considered in order to maintain the consistency of a Database in the presence of conflicting accesses to the Database performed by concurrent transactions. This serializability condition is considered herein as a general synchronization problem among transactions (or processes) which can be iterated infinitely often. The behaviour of such a system of transactions is represented by an infinite word over the alphabet of the operations performed by the transactions. Then a characterization of the prefixes of such behaviours satisfying the serializability condition - so-called correct behaviours - is given and it is shown that the set of all correct behaviours can be controlled by a finite automaton. As an example, the classical 'dining philosophers' problem is shown to be entirely modelled and solved as a serializability problem.
Mathematics Subject Classification ID: 68P20
Mathematics Subject Classification ID: 68N25
zbMATH DE Number: 3913726
zbMATH Keywords: database consistency
zbMATH Keywords: conflicting accesses
zbMATH Keywords: concurrent transactions
zbMATH Keywords: synchronization
zbMATH Keywords: infinite word
zbMATH Keywords: finite automaton
zbMATH Keywords: dining philosophers
MaRDI profile type: Publication
full work available at URL: 0304-3975(85)90206-3
OpenAlex ID: W1973182024
cites work: Q5525343
cites work: The notions of consistency and predicate locks in a database system
cites work: Parallel program schemata
cites work: Parallel Program Schemata and Maximal Parallelism I. Fundamental Results
cites work: Q3906402
cites work: Q4168054
description: scientific article; zbMATH DE number 3913726