{"id":"https://openalex.org/W2131072444","doi":"https://doi.org/10.1017/s1471068406002663","title":"Parametric Verification of a Group Membership Algorithm","display_name":"Parametric Verification of a Group Membership Algorithm","publication_year":2006,"publication_date":"2006-05-01","ids":{"openalex":"https://openalex.org/W2131072444","doi":"https://doi.org/10.1017/s1471068406002663","mag":"2131072444"},"language":"en","primary_location":{"id":"doi:10.1017/s1471068406002663","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068406002663","pdf_url":null,"source":{"id":"https://openalex.org/S59670734","display_name":"Theory and Practice of Logic Programming","issn_l":"1471-0684","issn":["1471-0684","1475-3081"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5045477471","display_name":"Ahmed Bouajjani","orcid":"https://orcid.org/0000-0002-2060-3592"},"institutions":[{"id":"https://openalex.org/I204730241","display_name":"Universit\u00e9 Paris Cit\u00e9","ror":"https://ror.org/05f82e368","country_code":"FR","type":"education","lineage":["https://openalex.org/I204730241"]},{"id":"https://openalex.org/I4210094115","display_name":"Laboratoire d'Informatique Algorithmique: Fondements et Applications","ror":"https://ror.org/00pbqgm18","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I204730241","https://openalex.org/I4210094115","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"AHMED BOUAJJANI","raw_affiliation_strings":["LIAFA, University of Paris 7, Case 7014, 2 place Jussieu, 75251 Paris 5, France (e-mail:","LIAFA, University of Paris 7, Case 7014, 2 place Jussieu, 75251 Paris 5, France (e-mail: abou@liafa.jussieu.fr)#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LIAFA, University of Paris 7, Case 7014, 2 place Jussieu, 75251 Paris 5, France (e-mail:","institution_ids":["https://openalex.org/I204730241","https://openalex.org/I4210094115"]},{"raw_affiliation_string":"LIAFA, University of Paris 7, Case 7014, 2 place Jussieu, 75251 Paris 5, France (e-mail: abou@liafa.jussieu.fr)#TAB#","institution_ids":["https://openalex.org/I204730241","https://openalex.org/I4210094115"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5071069677","display_name":"Agathe Merceron","orcid":"https://orcid.org/0000-0003-1015-5359"},"institutions":[{"id":"https://openalex.org/I4210094115","display_name":"Laboratoire d'Informatique Algorithmique: Fondements et Applications","ror":"https://ror.org/00pbqgm18","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I204730241","https://openalex.org/I4210094115","https://openalex.org/I4210159245"]},{"id":"https://openalex.org/I4210121459","display_name":"P\u00f4le L\u00e9onard de Vinci","ror":"https://ror.org/02setav13","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210121459"]},{"id":"https://openalex.org/I4210141169","display_name":"Ecole Sup\u00e9rieure d'Ing\u00e9nieurs L\u00e9onard de Vinci","ror":"https://ror.org/04sgy3p75","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210121459","https://openalex.org/I4210141169"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"AGATHE MERCERON","raw_affiliation_strings":["LIAFA and ESILV-GI, Technical University Leonard de Vinci, 92916 Paris La D\u00e9fense, France (e-mail:","LIAFA and ESILV-GI, Technical University Leonard de Vinci, 92916 Paris La D\u00e9fense, France (e-mail: Agathe.Merceron@liafa.jussieu.fr)#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LIAFA and ESILV-GI, Technical University Leonard de Vinci, 92916 Paris La D\u00e9fense, France (e-mail:","institution_ids":["https://openalex.org/I4210094115","https://openalex.org/I4210121459","https://openalex.org/I4210141169"]},{"raw_affiliation_string":"LIAFA and ESILV-GI, Technical University Leonard de Vinci, 92916 Paris La D\u00e9fense, France (e-mail: Agathe.Merceron@liafa.jussieu.fr)#TAB#","institution_ids":["https://openalex.org/I4210094115","https://openalex.org/I4210141169"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":3550,"currency":"USD","value_usd":3550},"apc_paid":null,"fwci":0.6512,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.72765721,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"6","issue":"3","first_page":"321","last_page":"353"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8498604893684387},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.7041130661964417},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.6557378768920898},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.5604154467582703},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5550706386566162},{"id":"https://openalex.org/keywords/parametric-statistics","display_name":"Parametric statistics","score":0.554867148399353},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5344981551170349},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.510964035987854},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3894798755645752},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.09852325916290283},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.08853957056999207}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8498604893684387},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.7041130661964417},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.6557378768920898},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.5604154467582703},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5550706386566162},{"id":"https://openalex.org/C117251300","wikidata":"https://www.wikidata.org/wiki/Q1849855","display_name":"Parametric statistics","level":2,"score":0.554867148399353},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5344981551170349},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.510964035987854},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3894798755645752},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.09852325916290283},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.08853957056999207},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s1471068406002663","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068406002663","pdf_url":null,"source":{"id":"https://openalex.org/S59670734","display_name":"Theory and Practice of Logic Programming","issn_l":"1471-0684","issn":["1471-0684","1475-3081"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.6100000143051147}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W1484571639","https://openalex.org/W1491913687","https://openalex.org/W1497272948","https://openalex.org/W1497571013","https://openalex.org/W1523445881","https://openalex.org/W1540180001","https://openalex.org/W1545238651","https://openalex.org/W1550288578","https://openalex.org/W1552932065","https://openalex.org/W1555742330","https://openalex.org/W1567137300","https://openalex.org/W1571284404","https://openalex.org/W1589224558","https://openalex.org/W1595006413","https://openalex.org/W1605302571","https://openalex.org/W1605695064","https://openalex.org/W1861590051","https://openalex.org/W1881102326","https://openalex.org/W1926085771","https://openalex.org/W1965765860","https://openalex.org/W1968448471","https://openalex.org/W2046895474","https://openalex.org/W2050304663","https://openalex.org/W2102796218","https://openalex.org/W2107264649","https://openalex.org/W2115088126","https://openalex.org/W2130564965","https://openalex.org/W2132661148","https://openalex.org/W2143923161","https://openalex.org/W2159542925","https://openalex.org/W2166752259"],"related_works":["https://openalex.org/W4256429076","https://openalex.org/W1971174658","https://openalex.org/W2099195351","https://openalex.org/W2348092930","https://openalex.org/W2012063272","https://openalex.org/W2138685729","https://openalex.org/W2062850566","https://openalex.org/W4308716484","https://openalex.org/W26693340","https://openalex.org/W2946244341"],"abstract_inverted_index":{"We":[0,102,119],"address":[1],"the":[2,9,48,54,110,122,129,135,141],"problem":[3],"of":[4,68,91,98,114,131],"verifying":[5],"clique":[6],"avoidance":[7],"in":[8,17,74,128],"TTP":[10,12],"protocol.":[11],"allows":[13,38,107],"several":[14],"stations":[15,69,73,92],"embedded":[16],"a":[18,39,95],"car":[19],"to":[20,26,29,41,61,108],"communicate.":[21],"It":[22],"has":[23,34],"many":[24],"mechanisms":[25],"ensure":[27],"robustness":[28],"faults.":[30],"In":[31,78],"particular,":[32],"it":[33,58],"an":[35,83,88,104],"algorithm":[36,51,111],"that":[37,106],"station":[40],"recognize":[42],"itself":[43],"as":[44,138,140],"faulty":[45],"and":[46,94],"leave":[47],"communication.":[49],"This":[50],"must":[52],"satisfy":[53],"crucial":[55],"\u2018non-clique\u2019":[56],"property:":[57],"is":[59],"impossible":[60],"have":[62,120],"two":[63],"or":[64],"more":[65],"disjoint":[66],"groups":[67],"communicating":[70],"exclusively":[71],"with":[72],"their":[75],"own":[76],"group.":[77],"this":[79,126],"paper,":[80],"we":[81],"propose":[82],"automatic":[84],"verification":[85],"method":[86],"for":[87],"arbitrary":[89],"number":[90,97],"$N$":[93],"given":[96],"faults":[99],"$k$":[100],".":[101],"give":[103],"abstraction":[105],"model":[109,127],"by":[112],"means":[113],"unbounded":[115],"(parametric)":[116],"counter":[117],"automata.":[118],"checked":[121],"non-clique":[123],"property":[124],"on":[125],"case":[130],"one":[132],"fault,":[133],"using":[134],"ALV":[136],"tool":[137],"well":[139],"LASH":[142],"tool.":[143]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}