Set semantics for asynchronous TeamLTL: expressivity and complexity

Abstract

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.

Metadata

Item Type:	Article
Authors/Creators:	Kontinen, J. Sandström, M. https://orcid.org/0000-0002-6365-2562 Virtema, J. https://orcid.org/0000-0002-1582-3718
Copyright, Publisher and Additional Information:	© 2025 The Author(s). This is an open access article distributed under the terms of the Creative Commons CC-BY license (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Keywords:	Hyperproperties; Linear Temporal Logic; Team Semantics
Dates:	Accepted: 26 March 2025 Published (online): 27 March 2025 Published: 27 March 2025
Institution:	The University of Sheffield
Academic Units:	The University of Sheffield > Faculty of Engineering (Sheffield) > Department of Computer Science (Sheffield)
Funding Information:	Funder Grant number DEUTSCHE FORSCHUNGSGEMEINSCHAFT 432788559
Depositing User:	Symplectic Sheffield
Date Deposited:	31 Mar 2025 14:35
Last Modified:	31 Mar 2025 14:35
Status:	Published online
Publisher:	Elsevier BV
Refereed:	Yes
Identification Number:	10.1016/j.ic.2025.105299
Open Archives Initiative ID (OAI ID):	oai:eprints.whiterose.ac.uk:225038

CORE (COnnecting REpositories)

Set semantics for asynchronous TeamLTL: expressivity and complexity

Abstract

Metadata

Download

External copy

Export

Statistics