Back to Search
Start Over
Control and synthesis of non-interferent timed systems.
- Source :
- International Journal of Control; Feb2015, Vol. 88 Issue 2, p217-236, 20p
- Publication Year :
- 2015
-
Abstract
- We focus on the control and the synthesis of secure timed systems which are modelled as timed automata. The security property that the system must satisfy is anon-interferenceproperty. Intuitively, non-interference ensures the absence of any causal dependency from a high-level domain to a lower level domain. Various notions of non-interference have been defined in the literature, and in this paper, we focus onstrong non-deterministic non-interference(SNNI) and two (bi)simulation-based variants thereof (cosimulation-based SNNI and bisimulation-based SNNI). These properties and their extensions have been mostly studied in the context of discrete event systems, while it is now well-known that time is an important attack vector against secure systems. At the same time, there is an obvious interest in going beyond simple verification to control problems: to be able to automatically make systems secure. We consider non-interference properties in the challenging setting of control of dense-time systems specified bytimed automataand we study the two following problems: (1) check whether it is possible to find a sub-system so that it is non-interferent; if yes, (2) compute a (largest) sub-system which is non-interferent. We exhibit decidable sub-classes for these problems, assess their theoretical complexities and provide effective algorithms based on the classical framework of timed games. [ABSTRACT FROM AUTHOR]
- Subjects :
- COMPUTER simulation
AUTOMATIC control systems
PROBLEM solving
ALGORITHMS
GAME theory
Subjects
Details
- Language :
- English
- ISSN :
- 00207179
- Volume :
- 88
- Issue :
- 2
- Database :
- Complementary Index
- Journal :
- International Journal of Control
- Publication Type :
- Academic Journal
- Accession number :
- 100099909
- Full Text :
- https://doi.org/10.1080/00207179.2014.944356