Log In Sign Up

Temporal Team Semantics Revisited

by   Jens Oliver Gutsfeld, et al.

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üchi Automata and obtain decidability results for the path checking problem as well as restricted variants of the model checking and satisfiability problems.


page 1

page 2

page 3

page 4


Linear-time Temporal Logic with Team Semantics: Expressivity and Complexity

We study the expressivity and the model checking problem of linear tempo...

On Verifying Timed Hyperproperties

We study the satisfiability and model-checking problems for timed hyperp...

Expressiveness and Decidability of Temporal Logics for Asynchronous Hyperproperties

Hyperproperties are properties of systems that relate different executio...

Modular SAT-based techniques for reasoning tasks in team semantics

We study the complexity of reasoning tasks for logics in team semantics....

Team Semantics for the Specification and Verification of Hyperproperties

We develop team semantics for Linear Temporal Logic (LTL) to express hyp...

A Temporal Logic for Strategic Hyperproperties

Hyperproperties are commonly used in computer security to define informa...

Automata and Fixpoints for Asynchronous Hyperproperties

Hyperproperties have received increasing attention in the last decade du...