Tournaments for mutual exclusion: verification and concurrent complexity

Wim H. Hesselink. Tournaments for mutual exclusion: verification and concurrent complexity. Formal Asp. Comput., 29(5):833-852, 2017. [doi]

@article{Hesselink17,
  title = {Tournaments for mutual exclusion: verification and concurrent complexity},
  author = {Wim H. Hesselink},
  year = {2017},
  doi = {10.1007/s00165-016-0407-x},
  url = {https://doi.org/10.1007/s00165-016-0407-x},
  researchr = {https://researchr.org/publication/Hesselink17},
  cites = {0},
  citedby = {0},
  journal = {Formal Asp. Comput.},
  volume = {29},
  number = {5},
  pages = {833-852},
}