Last update: Thu Sep 27 02:46:57 MDT 2018
@Article{Fle:1985:MSI,
author = "M. P. Fle and G. Roucairol",
title = "Maximal serializability of iterated transactions",
journal = j-THEOR-COMP-SCI,
volume = "38",
number = "1",
pages = "1--16",
month = may,
year = "1985",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory); C4250 (Database theory)",
corpsource = "Lab. de Recherche en Inf., Univ. de Paris-Sud, Orsay,
France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "concurrent transactions; conflicting accesses; correct
behaviours; database consistency; database theory;
dining philosophers; finite automata; finite automaton;
iterated transactions; maximal serialisability;
multiprocessing programs; synchronisation;
synchronization",
pubcountry = "Netherlands A01",
treatment = "T Theoretical or Mathematical",
}