{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,5,29]],"date-time":"2023-05-29T09:11:30Z","timestamp":1685351490905},"reference-count":3,"publisher":"National Library of Serbia","issue":"3","license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["ComSIS","COMPUT SCI INF SYST","COMPUT SCI INFORM SY","COMPUTER SCI INFORM","COMSIS J"],"published-print":{"date-parts":[[2011]]},"abstract":"<jats:p>Feature models are used to represent the variability and commonality of\n   software product lines (SPL), and to decide on the configuration of specific\n   applications. Several variants based on tree or graph hierarchical\n   structures have been proposed. These structures are completed with\n   additional constraints, generally expressed in parallel with the feature\n   diagram. This paper proposes the use of hypergraphs to integrate both\n   concepts in a unique characterization. Therefore, the definition, validation\n   and selection of feature configurations can be internally based on the\n   hypergraph properties and well-known algorithms, while the concrete visual\n   syntax remains unchanged for domain engineers. The implemented hypergraph\n   algorithms have been tested using a complete set of feature diagrams.\n   Finally a feature meta-model can be derived directly from the formal\n   definitions, providing the foundations for building feature modeling tools.<\/jats:p>","DOI":"10.2298\/csis100804016l","type":"journal-article","created":{"date-parts":[[2011,5,20]],"date-time":"2011-05-20T08:22:06Z","timestamp":1305879726000},"page":"611-633","source":"Crossref","is-referenced-by-count":0,"title":["Feature diagram formalization based on directed hypergraphs"],"prefix":"10.2298","volume":"8","author":[{"suffix":"A.","given":"Miguel","family":"Laguna","sequence":"first","affiliation":[{"name":"Department of Computer Science, University of Valladolid Campus M. Delibes, Valladolid, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"suffix":"M.","given":"Jos\u00e9","family":"Marqu\u00e9s","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Valladolid Campus M. Delibes, Valladolid, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guillermo","family":"Rodr\u00edguez-Cano","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Valladolid Campus M. Delibes, Valladolid, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1078","reference":[{"key":"1","doi-asserted-by":"publisher","DOI":"10.1002\/spip.213"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02735318"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2006.08.008"}],"container-title":["Computer Science and Information Systems"],"original-title":[],"language":"en","deposited":{"date-parts":[[2023,5,29]],"date-time":"2023-05-29T08:30:13Z","timestamp":1685349013000},"score":1,"resource":{"primary":{"URL":"https:\/\/doiserbia.nb.rs\/Article.aspx?ID=1820-02141100016L"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"references-count":3,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011]]}},"URL":"https:\/\/doi.org\/10.2298\/csis100804016l","relation":{},"ISSN":["1820-0214","2406-1018"],"issn-type":[{"value":"1820-0214","type":"print"},{"value":"2406-1018","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}