arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2205.01029cs.GTcs.LO
收藏

跨时空多智能体系统的验证与可实现性

Verification and Realizability in Finite-Horizon Multiagent Systems

Senthil Rajasekaran, Moshe Y. Vardi

摘要:

\emph{verification}和\emph{realizability}问题是反应系统分析中的两个中心问题。当考虑多智能体系统时,这些问题与纯策略纳什均衡的存在性(非空性)和纯策略纳什均衡的验证有着天然的相似性。最近,这方面的工作已经开始包括有限视野的时间目标。对于有限时域目标,目标表示有一个自然的层次结构,从确定性有限自动机(DFA)到非确定性有限自动机(NFA),再到交替有限自动机(AFA),每个连续表示之间有一个最坏情况的指数差距。以前的工作表明,DFA目标的可实现性问题是PSPACE完全的,而时态逻辑目标的可实现性问题是在2 EXPTIME。在这项工作中,我们研究了各种目标表示的可实现性和验证问题。我们首先表明,NFA目标的可实现性问题是EXPTIME-完全的,AFA目标是2 EXPTIME-完全的,从而建立严格的复杂性之间的差距,可实现性相对于DFA,NFA,AFA目标。然后,我们对比这些复杂性的差距与验证问题的复杂性,在那里我们表明,验证相对于DFA,NFA和AFA的目标是PSPACE完成。

英文摘要:

The problems of \emph{verification} and \emph{realizability} are two central themes in the analysis of reactive systems. When multiagent systems are considered, these problems have natural analogues of existence (nonemptiness) of pure-strategy Nash equilibria and verification of pure-strategy Nash equilibria. Recently, this body of work has begun to include finite-horizon temporal goals. With finite-horizon temporal goals, there is a natural hierarchy of goal representation, ranging from deterministic finite automata (DFA), to nondeterministic finite automata (NFA), and to alternating finite automata (AFA), with a worst-case exponential gap between each successive representation. Previous works showed that the realizability problem with DFA goals was PSPACE-complete, while the realizability problem with temporal logic goals is in 2EXPTIME. In this work, we study both the realizability and the verification problems with respect to various goal representations. We first show that the realizability problem with NFA goals is EXPTIME-complete and with AFA goals is 2EXPTIME-complete, thus establishing strict complexity gaps between realizability with respect to DFA, NFA, and AFA goals. We then contrast these complexity gaps with the complexity of the verification problem, where we show that verification with respect to DFAs, NFA, and AFA goals is PSPACE-complete.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑