配置管理中兼容性约束的一致性

[Proceedings] COMPEURO 88 - System Design: Concepts, Methods and Tools Pub Date : 1988-04-11 DOI:10.1109/CMPEUR.1988.4937

E. P. Gribomont, M. Lacroix, P. Lavency

{"title":"配置管理中兼容性约束的一致性","authors":"E. P. Gribomont, M. Lacroix, P. Lavency","doi":"10.1109/CMPEUR.1988.4937","DOIUrl":null,"url":null,"abstract":"The notion of compatibility constraints in a configuration management system is introduced. These constraints form a user-defined rule base; in such a context an efficient consistency verification is required. It is proved that checking the consistency of a set of compatibility constraints is an NP-complete problem. The restrictions needed to make the problem tractable are investigated. A linear algorithm is given for an important restricted case.<<ETX>>","PeriodicalId":415032,"journal":{"name":"[Proceedings] COMPEURO 88 - System Design: Concepts, Methods and Tools","volume":"80 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Consistency of compatibility constraints in configuration management\",\"authors\":\"E. P. Gribomont, M. Lacroix, P. Lavency\",\"doi\":\"10.1109/CMPEUR.1988.4937\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The notion of compatibility constraints in a configuration management system is introduced. These constraints form a user-defined rule base; in such a context an efficient consistency verification is required. It is proved that checking the consistency of a set of compatibility constraints is an NP-complete problem. The restrictions needed to make the problem tractable are investigated. A linear algorithm is given for an important restricted case.<<ETX>>\",\"PeriodicalId\":415032,\"journal\":{\"name\":\"[Proceedings] COMPEURO 88 - System Design: Concepts, Methods and Tools\",\"volume\":\"80 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1988-04-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[Proceedings] COMPEURO 88 - System Design: Concepts, Methods and Tools\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CMPEUR.1988.4937\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[Proceedings] COMPEURO 88 - System Design: Concepts, Methods and Tools","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CMPEUR.1988.4937","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

介绍了配置管理系统中兼容性约束的概念。这些约束形成了用户定义的规则库;在这种情况下，需要进行有效的一致性验证。证明了检验一组兼容约束的一致性是一个np完全问题。研究了使问题易于处理所需的限制条件。对于一个重要的限制情况，给出了一种线性算法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Consistency of compatibility constraints in configuration management

The notion of compatibility constraints in a configuration management system is introduced. These constraints form a user-defined rule base; in such a context an efficient consistency verification is required. It is proved that checking the consistency of a set of compatibility constraints is an NP-complete problem. The restrictions needed to make the problem tractable are investigated. A linear algorithm is given for an important restricted case.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

[Proceedings] COMPEURO 88 - System Design: Concepts, Methods and Tools

自引率

0.00%

发文量