On the complexity of Linearizability
Logic in Computer Science
2015-02-18 v2 Computational Complexity
Abstract
It was shown in Alur et al. [1] that the problem of verifying finite concurrent systems through Linearizability is in EXPSPACE. However, there was still a complexity gap between the easy to obtain PSPACE lower bound and the EXPSPACE upper bound. We show in this paper that Linearizability is EXPSPACE-complete.
Cite
@article{arxiv.1410.5000,
title = {On the complexity of Linearizability},
author = {Jad Hamza},
journal= {arXiv preprint arXiv:1410.5000},
year = {2015}
}