Name
Abstract | ||
|---|---|---|
In this paper, we focus on the synthesis of secure timed systems which are given by timed automata. The security property that the system must satisfy is a non-interference property. Various notions of non-interference have been defined in the literature, and in this paper we focus on Strong Non-deterministic Non-Interference (SNNI) and we study the two following problems: (1) check whether it is possible to enforce a system to be SNNI; if yes (2) compute a sub-system which is SNNI. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1007/978-3-642-04368-0_5 | FORMATS |
Keywords | Field | DocType |
following problem,strong non-deterministic non-interference,various notion,non-interference property,security property,non-interferent timed systems,timed automaton | Computer science,Automaton,Theoretical computer science,Timed automaton | Conference |
Volume | ISSN | Citations |
5813 | 0302-9743 | 6 |
PageRank | References | Authors |
0.52 | 13 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gilles Benattar | 1 | 10 | 1.26 |
| Franck Cassez | 2 | 825 | 46.76 |
| didier lime | 3 | 787 | 46.02 |
| olivier h roux | 4 | 671 | 46.30 |