International Conference on Dependable Systems and Networks, 2004最新文献_第9页

Fault tolerance tradeoffs in moving from decentralized to centralized embedded systems 从分散式嵌入式系统到集中式嵌入式系统的容错权衡

International Conference on Dependable Systems and Networks, 2004 Pub Date : 2004-06-28 DOI: 10.1109/DSN.2004.1311907

Jennifer Morris, D. Kroening, P. Koopman

引用次数: 8

Fault detection and isolation techniques for quasi delay-insensitive circuits 准延迟不敏感电路的故障检测与隔离技术

International Conference on Dependable Systems and Networks, 2004 Pub Date : 2004-06-28 DOI: 10.1109/DSN.2004.1311875

Christopher LaFrieda, R. Manohar

引用次数: 63

Assured reconfiguration of embedded real-time software 嵌入式实时软件的可靠重构

International Conference on Dependable Systems and Networks, 2004 Pub Date : 2004-06-28 DOI: 10.1109/DSN.2004.1311906

E. Strunk, J. Knight

引用次数: 32

Automated synthesis of multitolerance 多耐受性的自动合成

International Conference on Dependable Systems and Networks, 2004 Pub Date : 2004-06-28 DOI: 10.1109/DSN.2004.1311891

S. Kulkarni, Ali Ebnenasir

{"title":"Automated synthesis of multitolerance","authors":"S. Kulkarni, Ali Ebnenasir","doi":"10.1109/DSN.2004.1311891","DOIUrl":"https://doi.org/10.1109/DSN.2004.1311891","url":null,"abstract":"We concentrate on automated synthesis of multitolerant programs, i.e., programs that tolerate multiple classes of faults and provide a (possibly) different level of fault-tolerance to each class. We consider three levels of fault-tolerance: (1) failsafe, where in the presence of faults, the synthesized program guarantees safety, (2) nonmasking, where in the presence of faults, the synthesized program recovers to states from where its safety and liveness are satisfied, and (3) masking where in the presence of faults the synthesized program satisfies safety and recovers to states from where its safety and liveness are satisfied. We focus on the automated synthesis of finite-state multitolerant programs in high atomicity model where the program can read and write all its variables in an atomic step. We show that if one needs to add failsafe (respectively, nonmasking) fault-tolerance to one class of faults and masking fault-tolerance to another class of faults then such addition can be done in polynomial time in the state space of the fault-intolerant program. However, if one needs to add failsafe fault-tolerance to one class of faults and nonmasking fault-tolerance to another class of faults then the resulting problem is NP-complete. We find this result to be counterintuitive since adding failsafe and nonmasking fault-tolerance to the same class of faults (which is equivalent to adding masking fault-tolerance to that class of faults) can be done in polynomial time, whereas adding failsafe fault-tolerance to one class of faults and nonmasking fault-tolerance to a different class of faults is NP-complete.","PeriodicalId":436323,"journal":{"name":"International Conference on Dependable Systems and Networks, 2004","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125840076","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 40

Impact of path diversity on multi-homed and overlay networks 路径多样性对多归属和覆盖网络的影响

International Conference on Dependable Systems and Networks, 2004 Pub Date : 2004-06-28 DOI: 10.1109/DSN.2004.1311874

Junghee Han, F. Jahanian

引用次数: 43