Pages that link to "Item:Q1062471"

The following pages link to Maximal serializability of iterated transactions (Q1062471):

Displaying 26 items.

• On the concatenation of infinite traces (Q685439) (← links)
• Maximal serializability of iterated transactions (Q1062471) (← links)
• Infinite products in monoids (Q1080960) (← links)
• On some equations in free partially commutative monoids (Q1084189) (← links)
• Semi-commutations (Q1094144) (← links)
• On regular trace languages (Q1097040) (← links)
• Mixed product and asynchronous automata (Q1099643) (← links)
• Rewriting systems and word problems in a free partially commutative monoid (Q1102124) (← links)
• Theory of traces (Q1107296) (← links)
• 2-asynchronous automata (Q1109571) (← links)
• On recognizable subsets of free partially commutative monoids (Q1111703) (← links)
• Serialization of concurrent programs (Q1124386) (← links)
• Trace monoids with some invertible generators: Two decision problems (Q1179186) (← links)
• Decidability of the star problem in \(A^*\times{}\{ b\}^*\) (Q1201865) (← links)
• An extension of Kleene's and Ochmański's theorems to infinite traces (Q1318685) (← links)
• Comparison of algorithms controlling concurrent access to a database: A combinatorial approach (Q1823735) (← links)
• Concurrency measure in commutation monoids (Q1824702) (← links)
• 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) (Q1825050) (← links)
• Model-checking of correctness conditions for concurrent objects (Q1854357) (← links)
• Model checking transactional memories (Q2377134) (← links)
• Overlaps in free partially commutative monoids (Q2639969) (← links)
• Efficient solution of some problems in free partially commutative monoids (Q2640345) (← links)
• Compositions de fonctions de commutation partielle (Q3031949) (← links)
• Une condition suffisante de reconnaissabilité dans un monoïde partiellement commutatif (Q3734730) (← links)
• Word problems over traces which are solvable in linear time (Q5096152) (← links)
• Some trace monoids where both the Star problem and the Finite Power Property Problem are decidable (Q5096916) (← links)