Timed hyperproperties

We study the satisfiability and model-checking problems for timed hyperproperties specified with HyperMITL, a timed extension of HyperLTL. While the satisfiability problem can be solved similarly as for HyperLTL, we show that the model-checking problem for HyperMITL, 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 HyperMITL with quantifier alternations is possible under certain semantic restrictions. As an intermediate tool, we give an ‘asynchronous’ interpretation of Wilke's monadic logic of relative distance ( L d ↔ ) and show that it characterises timed languages recognised by timed automata with silent transitions.

Authors

• Hsi-Ming Ho
• Ruoyu Zhou
• Timothy M. Jones

Keywords

• Timed automata
• Temporal logics
• Cybersecurity