Mila E. Majster-Cederbaum, Nils Semmelrock. Reachability in Tree-Like Component Systems is PSPACE-Complete. Electronic Notes in Theoretical Computer Science, 263:197-210, 2010. [doi]
@article{Majster-CederbaumS10,
title = {Reachability in Tree-Like Component Systems is PSPACE-Complete},
author = {Mila E. Majster-Cederbaum and Nils Semmelrock},
year = {2010},
doi = {10.1016/j.entcs.2010.05.012},
url = {http://dx.doi.org/10.1016/j.entcs.2010.05.012},
tags = {completeness, e-science},
researchr = {https://researchr.org/publication/Majster-CederbaumS10},
cites = {0},
citedby = {0},
journal = {Electronic Notes in Theoretical Computer Science},
volume = {263},
pages = {197-210},
}