具有结构约束的协同系统的可达性是PSPACE-完全的
Reachability in Cooperating Systems with Architectural Constraints is PSPACE-Complete
摘要：
协作系统的可达性问题是PSPACE完备的。我们在这里表明，这个问题仍然是PSPACE完整的，当我们限制子系统之间的通信结构以各种方式。为了这个目的，我们介绍了两个基本的和不可比拟的合作系统，经常在实践中出现的子类，并提供各自的减少。我们考虑的子类包括合作系统的通信结构分别形成一条线一个星。
英文摘要：
The reachability problem in cooperating systems is known to be PSPACE-complete. We show here that this problem remains PSPACE-complete when we restrict the communication structure between the subsystems in various ways. For this purpose we introduce two basic and incomparable subclasses of cooperating systems that occur often in practice and provide respective reductions. The subclasses we consider consist of cooperating systems the communication structure of which forms a line respectively a star.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
