Safety checking over tree topologies with fixed phases is EXPSPACE-complete and with variable phases is 2EXPSPACE-complete; depth bounds yield complexities in the fast growing hierarchy.
21 Yonit Kesten, Oded Maler, Monica Marcus, Amir Pnueli, and Elad Shahar
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On Parameterized Verification Over Tree Topologies
Safety checking over tree topologies with fixed phases is EXPSPACE-complete and with variable phases is 2EXPSPACE-complete; depth bounds yield complexities in the fast growing hierarchy.