We study the influence of parameters like the number of contexts, phases, and stacks on the complexity of solving parity games over concurrent recursive programs. Our first result shows that k-context games are b-EXPTIME-complete, where b = max{k-2, 1}. This means up to three contexts do not increase the complexity over an analysis for the sequential case. Our second result shows that for ordered k-stack as well as k-phase games the complexity jumps to k-EXPTIME-complete.
展开▼
机译：我们研究了与上下文，阶段数量，阶段数量的参数的影响，以通过并发递归程序解决奇偶校验游戏的复杂性。我们的第一个结果表明，K-Context游戏是B-EXPTIME-CLOSED，其中B = MAX {K-2,1}。这意味着最多三个上下文不会在顺序案例的分析上增加复杂性。我们的第二个结果表明，对于有序的K堆栈以及K相游戏，复杂性跳转到k-exptime-complete。
展开▼
