Abstract
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 semi-commutative alphabet. The three model checking problems are shown to be, respectively, in PSPACE, in EXPSPACE, and undecidable.
| Original language | English |
|---|---|
| Pages (from-to) | 219-228 |
| Number of pages | 10 |
| Journal | Proceedings - Symposium on Logic in Computer Science |
| State | Published - 1996 |
| Externally published | Yes |
| Event | Proceedings of the 1996 11th Annual IEEE Symposium on Logic in Computer Science, LICS'96 - New Brunswick, NJ, USA Duration: 27 Jul 1996 → 30 Jul 1996 |