Parametric non-interference in timed automata

10/19/2020
by   Étienne André, et al.
0

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.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

02/08/2019

Minimal-Time Synthesis for Parametric Timed Automata

Parametric timed automata (PTA) extend timed automata by allowing parame...
08/19/2019

On the expressive power of invariants in parametric timed automata

The verification of systems combining hard timing constraints with concu...
04/20/2020

Reachability and liveness in parametric timed automata

We study timed systems in which some timing features are unknown paramet...
11/13/2020

Reachability in two-parametric timed automata with one parameter is EXPSPACE-complete

Parametric timed automata (PTA) are an extension of timed automata in wh...
11/30/2018

Parametric Timed Broadcast Protocols

In this paper we consider state reachability in networks composed of man...
07/01/2019

Parametric Timed Model Checking for Guaranteeing Timed Opacity

Information leakage can have dramatic consequences on systems security. ...
09/04/2019

On the k-synchronizability of systems

In this paper, we work on the notion of k-synchronizability: a system is...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.