Bisimilarity of One-Counter Processes Is PSPACE-Complete

Stanislav Böhm, Stefan Göller, Petr Jancar. Bisimilarity of One-Counter Processes Is PSPACE-Complete. In Paul Gastin, François Laroussinie, editors, CONCUR 2010 - Concurrency Theory, 21th International Conference, CONCUR 2010, Paris, France, August 31-September 3, 2010. Proceedings. Volume 6269 of Lecture Notes in Computer Science, pages 177-191, Springer, 2010. [doi]

@inproceedings{BohmGJ10,
  title = {Bisimilarity of One-Counter Processes Is PSPACE-Complete},
  author = {Stanislav Böhm and Stefan Göller and Petr Jancar},
  year = {2010},
  doi = {10.1007/978-3-642-15375-4_13},
  url = {http://dx.doi.org/10.1007/978-3-642-15375-4_13},
  tags = {completeness},
  researchr = {https://researchr.org/publication/BohmGJ10},
  cites = {0},
  citedby = {0},
  pages = {177-191},
  booktitle = {CONCUR 2010 - Concurrency Theory, 21th International Conference, CONCUR 2010, Paris, France, August 31-September 3, 2010. Proceedings},
  editor = {Paul Gastin and François Laroussinie},
  volume = {6269},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-15374-7},
}