{"id":"https://openalex.org/W2399577786","doi":"https://doi.org/10.29007/gt85","title":"Finite countermodels as invariants. A case study in verification of parameterized mutual exclusion protocol","display_name":"Finite countermodels as invariants. A case study in verification of parameterized mutual exclusion protocol","publication_year":2018,"publication_date":"2018-01-23","ids":{"openalex":"https://openalex.org/W2399577786","doi":"https://doi.org/10.29007/gt85","mag":"2399577786"},"language":"en","primary_location":{"id":"doi:10.29007/gt85","is_oa":true,"landing_page_url":"https://doi.org/10.29007/gt85","pdf_url":"https://easychair.org/publications/open/5dM","source":{"id":"https://openalex.org/S4220651395","display_name":"EPiC series in computing","issn_l":"2398-7340","issn":["2398-7340"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EPiC Series in Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://easychair.org/publications/open/5dM","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5057274980","display_name":"Alexei Lisitsa","orcid":"https://orcid.org/0000-0002-3820-643X"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Alexei Lisitsa","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5057274980"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.00638298,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"1","issue":null,"first_page":"150","last_page":"147"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10142","display_name":"Formal Methods in Verification","score":0.9970999956130981,"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.9936000108718872,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mutual-exclusion","display_name":"Mutual exclusion","score":0.8992130160331726},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.791366696357727},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.7388514280319214},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6046618223190308},{"id":"https://openalex.org/keywords/predicate","display_name":"Predicate (mathematical logic)","score":0.5872824192047119},{"id":"https://openalex.org/keywords/invariant","display_name":"Invariant (physics)","score":0.5175506472587585},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.49057358503341675},{"id":"https://openalex.org/keywords/protocol","display_name":"Protocol (science)","score":0.46251216530799866},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.43200817704200745},{"id":"https://openalex.org/keywords/linear-temporal-logic","display_name":"Linear temporal logic","score":0.42401063442230225},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3941863775253296},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35429102182388306},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.34295353293418884},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.14396870136260986}],"concepts":[{"id":"https://openalex.org/C56348326","wikidata":"https://www.wikidata.org/wiki/Q1047554","display_name":"Mutual exclusion","level":2,"score":0.8992130160331726},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.791366696357727},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.7388514280319214},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6046618223190308},{"id":"https://openalex.org/C140146324","wikidata":"https://www.wikidata.org/wiki/Q1144319","display_name":"Predicate (mathematical logic)","level":2,"score":0.5872824192047119},{"id":"https://openalex.org/C190470478","wikidata":"https://www.wikidata.org/wiki/Q2370229","display_name":"Invariant (physics)","level":2,"score":0.5175506472587585},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.49057358503341675},{"id":"https://openalex.org/C2780385302","wikidata":"https://www.wikidata.org/wiki/Q367158","display_name":"Protocol (science)","level":3,"score":0.46251216530799866},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.43200817704200745},{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.42401063442230225},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3941863775253296},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35429102182388306},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34295353293418884},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.14396870136260986},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"score":0.0},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0},{"id":"https://openalex.org/C204787440","wikidata":"https://www.wikidata.org/wiki/Q188504","display_name":"Alternative medicine","level":2,"score":0.0},{"id":"https://openalex.org/C142724271","wikidata":"https://www.wikidata.org/wiki/Q7208","display_name":"Pathology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.29007/gt85","is_oa":true,"landing_page_url":"https://doi.org/10.29007/gt85","pdf_url":"https://easychair.org/publications/open/5dM","source":{"id":"https://openalex.org/S4220651395","display_name":"EPiC series in computing","issn_l":"2398-7340","issn":["2398-7340"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EPiC Series in Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.29007/gt85","is_oa":true,"landing_page_url":"https://doi.org/10.29007/gt85","pdf_url":"https://easychair.org/publications/open/5dM","source":{"id":"https://openalex.org/S4220651395","display_name":"EPiC series in computing","issn_l":"2398-7340","issn":["2398-7340"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EPiC Series in Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","score":0.8199999928474426,"display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2399577786.pdf"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2884574904","https://openalex.org/W172552882","https://openalex.org/W2350953867","https://openalex.org/W2149977550","https://openalex.org/W70902631","https://openalex.org/W2085847302","https://openalex.org/W2127730763","https://openalex.org/W1592102986","https://openalex.org/W4313193894","https://openalex.org/W3209681654"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,51,54,60],"case":[3],"study":[4],"of":[5,8,26,30,38,47,56],"the":[6,31],"verification":[7,19,49],"parameterized":[9],"mutual":[10],"exclusion":[11],"protocol":[12,32],"using":[13],"finite":[14,52],"model":[15],"finder":[16],"Mace4.":[17],"Thhe":[18],"follows":[20],"an":[21],"approach":[22],"based":[23],"on":[24],"modeling":[25],"reachability":[27],"between":[28,35],"states":[29,39],"as":[33],"deducibility":[34],"appropriate":[36],"encodings":[37],"by":[40],"first-order":[41],"predicate":[42],"logic":[43],"formulae.":[44],"The":[45],"result":[46],"successful":[48],"is":[50],"countermodel,":[53],"witness":[55],"non-deducibility,":[57],"which":[58],"represents":[59],"system":[61],"invariant.":[62]},"counts_by_year":[{"year":2013,"cited_by_count":2}],"updated_date":"2026-05-22T06:13:13.366637","created_date":"2025-10-10T00:00:00"}