Maximal serializability of iterated transactions

DOI10.1016/0304-3975(85)90206-3zbMath0572.68082OpenAlexW1973182024MaRDI QIDQ1062471

G. Roucairol, Marie-Paule Flé

Publication date: 1985

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(85)90206-3

zbMATH Keywords

synchronizationfinite automatoninfinite worddining philosophersconcurrent transactionsconflicting accessesdatabase consistency

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Theory of operating systems (68N25)

Related Items (26)

Infinite products in monoids ⋮ On some equations in free partially commutative monoids ⋮ Semi-commutations ⋮ Model checking transactional memories ⋮ On regular trace languages ⋮ Mixed product and asynchronous automata ⋮ Rewriting systems and word problems in a free partially commutative monoid ⋮ Overlaps in free partially commutative monoids ⋮ Efficient solution of some problems in free partially commutative monoids ⋮ Theory of traces ⋮ Une condition suffisante de reconnaissabilité dans un monoïde partiellement commutatif ⋮ 2-asynchronous automata ⋮ On recognizable subsets of free partially commutative monoids ⋮ Serialization of concurrent programs ⋮ Some trace monoids where both the Star problem and the Finite Power Property Problem are decidable ⋮ Trace monoids with some invertible generators: Two decision problems ⋮ On the concatenation of infinite traces ⋮ Decidability of the star problem in \(A^*\times{}\{ b\}^*\) ⋮ Compositions de fonctions de commutation partielle ⋮ Word problems over traces which are solvable in linear time ⋮ Comparison of algorithms controlling concurrent access to a database: A combinatorial approach ⋮ Concurrency measure in commutation monoids ⋮ Combinatoire des mots et étude quantitative de la sérialisabilité: Application à la concurrence d'accès à une base de données. (Combinatorics of words and the quantitative study of serializability: Application to the concurrence of database access) ⋮ Model-checking of correctness conditions for concurrent objects ⋮ Maximal serializability of iterated transactions ⋮ An extension of Kleene's and Ochmański's theorems to infinite traces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maximal serializability of iterated transactions
• Parallel program schemata
• The notions of consistency and predicate locks in a database system
• Parallel Program Schemata and Maximal Parallelism I. Fundamental Results

This page was built for publication: Maximal serializability of iterated transactions