English

Parametric non-interference in timed automata

Formal Languages and Automata Theory 2020-10-20 v1 Cryptography and Security

Abstract

We consider a notion of non-interference for timed automata (TAs) that allows to quantify the frequency of an attack; that is, we infer values of the minimal time between two consecutive actions of the attacker, so that (s)he disturbs the set of reachable locations. We also synthesize valuations for the timing constants of the TA (seen as parameters) guaranteeing non-interference. We show that this can reduce to reachability synthesis in parametric timed automata. We apply our method to a model of the Fischer mutual exclusion protocol and obtain preliminary results.

Keywords

Cite

@article{arxiv.2010.09527,
  title  = {Parametric non-interference in timed automata},
  author = {Étienne André and Aleksander Kryukov},
  journal= {arXiv preprint arXiv:2010.09527},
  year   = {2020}
}

Comments

This is the author version of the manuscript of the same name published in the proceedings of the 25th International Conference on Engineering of Complex Computer Systems (ICECCS 2020)

R2 v1 2026-06-23T19:27:13.146Z