The notions of serializability, linearizability and sequential consistency are used in the speci cation of concurrent systems. We show that the model checking problem for each of these properties can be cast in terms of the containment of one regular language in another regular language shu ed using a semi-commutative alphabet. The three model checking problems are shown to be, respectively, in Pspace, in Expspace, and undecidable.
Sequential consistency was shown to be undecidable REF .
Model-Checking of Correctness Conditions for Concurrent Objects
Information and Computation
Computer Science Mathematics