TY - JOUR
T1 - Model-checking of correctness conditions for concurrent objects
AU - Alur, Rajeev
AU - McMillan, Ken
AU - Peled, Doron
PY - 2000
Y1 - 2000
N2 - The notions of serializability, linearizability, and sequential consistency are used in the specification 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 shuffled using a semicommutative alphabet. The three model checking problems are shown to be, respectively, in PSPACE, in EXPSPACE, and undecidable.
AB - The notions of serializability, linearizability, and sequential consistency are used in the specification 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 shuffled using a semicommutative alphabet. The three model checking problems are shown to be, respectively, in PSPACE, in EXPSPACE, and undecidable.
UR - http://www.scopus.com/inward/record.url?scp=0034632152&partnerID=8YFLogxK
U2 - 10.1006/inco.1999.2847
DO - 10.1006/inco.1999.2847
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0034632152
SN - 0890-5401
VL - 160
SP - 167
EP - 188
JO - Information and Computation
JF - Information and Computation
IS - 1-2
ER -