•There is a beautiful mathematical theory, based on formal languages
–Eg the task of testing whether an execution is serializable is NP
•There is a nice sufficient condition (ie a conservative approximation) called conflict serializable, which can be efficiently tested
–based on absence of cycles in a graph
•Most people and books use the approximation, usually without mentioning it!