Log In Sign Up

On Verifying Timed Hyperproperties

by   Hsi-Ming Ho, et al.

We study the satisfiability and model-checking problems for timed hyperproperties specified with HyperMTL, a timed extension of HyperLTL. Depending on whether interleaving of events in different traces is allowed, two possible semantics can be defined for timed hyperproperties: asynchronous and synchronous. While the satisfiability problem can be decided similarly to HyperLTL regardless of the choice of semantics, we show that the model-checking problem, unless the specification is alternation-free, is undecidable even when very restricted timing constraints are allowed. On the positive side, we show that model checking HyperMTL with quantifier alternations is possible under certain conditions in the synchronous semantics, or when there is a fixed bound on the length of the time domain.


page 1

page 2

page 3

page 4


Temporal Team Semantics Revisited

In this paper, we study a novel approach to asynchronous hyperproperties...

A Temporal Logic for Asynchronous Hyperproperties

Hyperproperties are properties of computational systems that require mor...

Parametric Interval Temporal Logic over Infinite Words

Model checking for Halpern and Shoham's interval temporal logic HS has b...

Good-for-Game QPTL: An Alternating Hodges Semantics

An extension of QPTL is considered where functional dependencies among t...

Bayesian Statistical Model Checking for Multi-agent Systems using HyperPCTL*

In this paper, we present a Bayesian method for statistical model checki...

Scalar and Vectorial mu-calculus with Atoms

We study an extension of modal mu-calculus to sets with atoms and we stu...

Satisfiability and Containment of Recursive SHACL

The Shapes Constraint Language (SHACL) is the recent W3C recommendation ...