Referenced Items are not available for this document.
Survivable systems are modelled abstractly as collections of services supported by any of a set of configurations of components. Reconfiguration to restore services as a result of component failure is viewed as a kind of “flow” analogous to information flow. We apply C. Meadows' (1990) theorem on datset aggregates to characterize the maximum safe flow policy for distributed systems. For reconfiguration, safety means that services are preserved and that that reconfiguration rules may be stated and applied locally, with respect to just the failed components
Published in:
Security and Privacy, 1999. Proceedings of the 1999 IEEE Symposium on
Date of Conference: 1999
- Page(s):
- 48 - 56
- Meeting Date :
- 09 May 1999-12 May 1999
- ISSN :
- 1081-6011
- Print ISBN:
- 0-7695-0176-1
- INSPEC Accession Number:
- 6289303
- Conference Location :
- Oakland, CA
- Digital Object Identifier :
- 10.1109/SECPRI.1999.766717
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
