In this paper, we study a novel approach to asynchronous hyperproperties by reconsidering the foundations of temporal team semantics. We consider three logics: TeamLTL, TeamCTL and TeamCTL*, which are obtained by adding quantification over so-called time evaluation functions controlling the asynchronous progress of traces. We then relate synchronous TeamLTL to our new logics and show how it can be embedded into them. We show that the model checking problem for exTeamCTL with Boolean disjunctions is highly undecidable by encoding recurrent computations of non-deterministic 2-counter machines. Finally, we present a translation of TeamCTL* to Alternating Asynchronous B\"uchi Automata and obtain decidability results for the path checking problem as well as restricted variants of the model checking and satisfiability problems.

翻译：在本文中,我们通过重新考虑时间团队语义学的基础来研究一种新颖的对非同步超异性的做法。 我们考虑了三种逻辑: TeamL、 TeetCTL 和 TeetCTL *, 这是通过在所谓的时间评估功能中增加量化来控制不同步的痕迹进展而获得的。 然后我们将同步TeetLTL和我们的新逻辑联系起来, 并展示它是如何嵌入其中的。 我们显示, 将非非非非非非定性2对角机器的经常性计算编码, 将前TeamCTL* 转换为对等的 Asyncronous B\\"uchi Automata, 并获得路径检查问题的衰减结果, 以及模型检查和可覆盖性问题的限制性变体。