{"id":"https://openalex.org/W200623142","doi":"https://doi.org/10.1007/978-3-662-44584-6_10","title":"On the Completeness of Bounded Model Checking for Threshold-Based Distributed\u00a0Algorithms: Reachability","display_name":"On the Completeness of Bounded Model Checking for Threshold-Based Distributed\u00a0Algorithms: Reachability","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W200623142","doi":"https://doi.org/10.1007/978-3-662-44584-6_10","mag":"200623142"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-662-44584-6_10","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-662-44584-6_10","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5040967690","display_name":"Igor Konnov","orcid":"https://orcid.org/0000-0001-6629-3377"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"Igor Konnov","raw_affiliation_strings":["Vienna University of Technology (TU Wien), Wien, Austria"],"affiliations":[{"raw_affiliation_string":"Vienna University of Technology (TU Wien), Wien, Austria","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110701511","display_name":"Helmut Veith","orcid":null},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Helmut Veith","raw_affiliation_strings":["Vienna University of Technology (TU Wien), Wien, Austria"],"affiliations":[{"raw_affiliation_string":"Vienna University of Technology (TU Wien), Wien, Austria","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012763670","display_name":"Josef Widder","orcid":"https://orcid.org/0000-0003-2795-611X"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Josef Widder","raw_affiliation_strings":["Vienna University of Technology (TU Wien), Wien, Austria"],"affiliations":[{"raw_affiliation_string":"Vienna University of Technology (TU Wien), Wien, Austria","institution_ids":["https://openalex.org/I145847075"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5040967690"],"corresponding_institution_ids":["https://openalex.org/I145847075"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":7.5867,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.97605309,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"125","last_page":"140"},"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.9998999834060669,"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.9998999834060669,"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.9883999824523926,"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/T12288","display_name":"Optimization and Search Problems","score":0.9860000014305115,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.9099389314651489},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.8389666676521301},{"id":"https://openalex.org/keywords/liveness","display_name":"Liveness","score":0.8364801406860352},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.7526490688323975},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7430567741394043},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.7221255302429199},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.6130232214927673},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.5600075721740723},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.525464653968811},{"id":"https://openalex.org/keywords/parametric-statistics","display_name":"Parametric statistics","score":0.5069551467895508},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4871068000793457},{"id":"https://openalex.org/keywords/abstraction","display_name":"Abstraction","score":0.48632699251174927},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4354782998561859},{"id":"https://openalex.org/keywords/abstraction-model-checking","display_name":"Abstraction model checking","score":0.41306692361831665},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20110028982162476}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.9099389314651489},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.8389666676521301},{"id":"https://openalex.org/C15569618","wikidata":"https://www.wikidata.org/wiki/Q3561421","display_name":"Liveness","level":2,"score":0.8364801406860352},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.7526490688323975},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7430567741394043},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7221255302429199},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.6130232214927673},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.5600075721740723},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.525464653968811},{"id":"https://openalex.org/C117251300","wikidata":"https://www.wikidata.org/wiki/Q1849855","display_name":"Parametric statistics","level":2,"score":0.5069551467895508},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4871068000793457},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.48632699251174927},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4354782998561859},{"id":"https://openalex.org/C30888246","wikidata":"https://www.wikidata.org/wiki/Q4669969","display_name":"Abstraction model checking","level":3,"score":0.41306692361831665},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20110028982162476},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-662-44584-6_10","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-662-44584-6_10","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.872.3003","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.872.3003","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://forsyte.at/wp-content/uploads/concur14-reachability.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W111201530","https://openalex.org/W174184838","https://openalex.org/W1489391022","https://openalex.org/W1528441743","https://openalex.org/W1531261972","https://openalex.org/W1540501475","https://openalex.org/W1554005697","https://openalex.org/W1586035363","https://openalex.org/W1597578789","https://openalex.org/W1787074469","https://openalex.org/W1799788669","https://openalex.org/W2015135700","https://openalex.org/W2016300863","https://openalex.org/W2028113097","https://openalex.org/W2031276295","https://openalex.org/W2042876806","https://openalex.org/W2072062729","https://openalex.org/W2073126252","https://openalex.org/W2099860748","https://openalex.org/W2113100977","https://openalex.org/W2122326479","https://openalex.org/W2133055577","https://openalex.org/W2133943294","https://openalex.org/W2144391712","https://openalex.org/W2147351452","https://openalex.org/W2164598186","https://openalex.org/W2336925918","https://openalex.org/W2611515161","https://openalex.org/W3137220996"],"related_works":["https://openalex.org/W4312626387","https://openalex.org/W1989082972","https://openalex.org/W2790897865","https://openalex.org/W2015160737","https://openalex.org/W1583061463","https://openalex.org/W2103504376","https://openalex.org/W2153337086","https://openalex.org/W2135051863","https://openalex.org/W1651168384","https://openalex.org/W2111654715"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":3}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}