条件简单时态网络的动态可控性是PSPACE-完全的
Dynamic Controllability of Conditional Simple Temporal Networks is PSPACE-complete
摘要：
即使在提出了各种求解算法之后，检查条件时态网络是否是动态可控的精确计算复杂性仍然是广泛开放的。本文解决了这一问题，给出了构造、算法、桥接引理和参数，形式化地证明了：（1）问题是PSPACE-困难的，（2）问题存在于PSPACE中。
英文摘要：
Even after the proposal of various solution algorithms, the precise computational complexity of checking whether a Conditional Temporal Network is Dynamically Controllable had still remained widely open. This issue gets settled in this paper which provides constructions, algorithms, and bridging lemmas and arguments to formally prove that: (1) the problem is PSPACE-hard, and (2) the problem lies in PSPACE.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
