Alternating-time temporal logic ATL with finitely bounded semantics.

Theoretical Computer Science(2019)

引用 7|浏览28
暂无评分
摘要
We study a variant ATLFB of the alternating-time temporal logic ATL with a non-standard, ‘finitely bounded’ semantics (FBS). FBS was originally defined as a game-theoretic semantics where players must commit to time limits when attempting to verify eventuality (respectively, to falsify safety) formulae. It turns out that FBS has a natural corresponding compositional semantics that essentially evaluates formulae only on finite initial segments of paths and imposes uniform bounds on all plays for the fulfilment of eventualities. The resulting version ATLFB differs in some essential features from the standard ATL, as it no longer has the finite model property, though the two logics are equivalent on finite models.
更多
查看译文
关键词
Alternating-time temporal logic,Finitely bounded semantics,Tableaux,Decidability,Axiomatization,Completeness
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要