Set semantics for asynchronous TeamLTL: Expressivity and complexity

We introduce and develop a set-based semantics for asynchronous TeamLTL. We consider two canonical logics in this setting: the extensions of TeamLTL by the Boolean disjunction and by the Boolean negation. We relate the new semantics with the original semantics based on multisets and establish one of the first positive complexity theoretic results in the temporal team semantics setting. In particular we show that both logics enjoy normal forms that can be utilised to obtain results related to expressivity and complexity (decidability) of the new logics.

Authors

• Juha Kontinen
• Max Sandström
• Jonni Virtema

Keywords

• Hyperproperties
• Linear temporal logic
• Team semantics