{"id":"https://openalex.org/W1571136502","doi":"https://doi.org/10.1007/978-3-642-14052-5_7","title":"A Formal Proof of a Necessary and Sufficient Condition for Deadlock-Free Adaptive Networks","display_name":"A Formal Proof of a Necessary and Sufficient Condition for Deadlock-Free Adaptive Networks","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W1571136502","doi":"https://doi.org/10.1007/978-3-642-14052-5_7","mag":"1571136502"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-14052-5_7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-14052-5_7","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/A5067135306","display_name":"Freek Verbeek","orcid":"https://orcid.org/0000-0002-6625-1123"},"institutions":[{"id":"https://openalex.org/I145872427","display_name":"Radboud University Nijmegen","ror":"https://ror.org/016xsfp80","country_code":"NL","type":"education","lineage":["https://openalex.org/I145872427"]},{"id":"https://openalex.org/I7876267","display_name":"Open University of the Netherlands","ror":"https://ror.org/018dfmf50","country_code":"NL","type":"education","lineage":["https://openalex.org/I7876267"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Freek Verbeek","raw_affiliation_strings":["Institute for Computing and Information Sciences, Radboud University Nijmegen, P.O. Box 9010, 6500GL, Nijmegen, The Netherlands","School of Computer Science, Open University of the Netherlands, P.O. Box, 6401DL, Heerlen, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Institute for Computing and Information Sciences, Radboud University Nijmegen, P.O. Box 9010, 6500GL, Nijmegen, The Netherlands","institution_ids":["https://openalex.org/I145872427"]},{"raw_affiliation_string":"School of Computer Science, Open University of the Netherlands, P.O. Box, 6401DL, Heerlen, The Netherlands","institution_ids":["https://openalex.org/I7876267"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5088595514","display_name":"Julien Schmaltz","orcid":null},"institutions":[{"id":"https://openalex.org/I145872427","display_name":"Radboud University Nijmegen","ror":"https://ror.org/016xsfp80","country_code":"NL","type":"education","lineage":["https://openalex.org/I145872427"]},{"id":"https://openalex.org/I7876267","display_name":"Open University of the Netherlands","ror":"https://ror.org/018dfmf50","country_code":"NL","type":"education","lineage":["https://openalex.org/I7876267"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Julien Schmaltz","raw_affiliation_strings":["Institute for Computing and Information Sciences, Radboud University Nijmegen, P.O. Box 9010, 6500GL, Nijmegen, The Netherlands","School of Computer Science, Open University of the Netherlands, P.O. Box, 6401DL, Heerlen, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Institute for Computing and Information Sciences, Radboud University Nijmegen, P.O. Box 9010, 6500GL, Nijmegen, The Netherlands","institution_ids":["https://openalex.org/I145872427"]},{"raw_affiliation_string":"School of Computer Science, Open University of the Netherlands, P.O. Box, 6401DL, Heerlen, The Netherlands","institution_ids":["https://openalex.org/I7876267"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5067135306"],"corresponding_institution_ids":["https://openalex.org/I145872427","https://openalex.org/I7876267"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.6489,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.8293883,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"67","last_page":"82"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":1.0,"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/T10829","display_name":"Interconnection Networks and Systems","score":1.0,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9987000226974487,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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.8346936702728271},{"id":"https://openalex.org/keywords/soundness","display_name":"Soundness","score":0.826959490776062},{"id":"https://openalex.org/keywords/deadlock","display_name":"Deadlock","score":0.7290264368057251},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5253236293792725},{"id":"https://openalex.org/keywords/formal-proof","display_name":"Formal proof","score":0.5243428349494934},{"id":"https://openalex.org/keywords/intuition","display_name":"Intuition","score":0.4790845513343811},{"id":"https://openalex.org/keywords/deadlock-prevention-algorithms","display_name":"Deadlock prevention algorithms","score":0.42752954363822937},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3977581560611725},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.34412243962287903},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16260430216789246},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.15509149432182312}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8346936702728271},{"id":"https://openalex.org/C39920170","wikidata":"https://www.wikidata.org/wiki/Q693083","display_name":"Soundness","level":2,"score":0.826959490776062},{"id":"https://openalex.org/C159023740","wikidata":"https://www.wikidata.org/wiki/Q623276","display_name":"Deadlock","level":2,"score":0.7290264368057251},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5253236293792725},{"id":"https://openalex.org/C94461902","wikidata":"https://www.wikidata.org/wiki/Q2762418","display_name":"Formal proof","level":3,"score":0.5243428349494934},{"id":"https://openalex.org/C132010649","wikidata":"https://www.wikidata.org/wiki/Q189222","display_name":"Intuition","level":2,"score":0.4790845513343811},{"id":"https://openalex.org/C113429609","wikidata":"https://www.wikidata.org/wiki/Q4060699","display_name":"Deadlock prevention algorithms","level":3,"score":0.42752954363822937},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3977581560611725},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.34412243962287903},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16260430216789246},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.15509149432182312},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/978-3-642-14052-5_7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-14052-5_7","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:pure.tue.nl:openaire_cris_publications/464416ff-b544-4c9d-9c11-b97ac2176bd5","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/464416ff-b544-4c9d-9c11-b97ac2176bd5","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Verbeek, F & Schmaltz, J 2010, A formal proof of a necessary and sufficient condition for deadlock-free adaptive networks. in M Kaufmann & L C Paulson (eds), Interactive Theorem Proving (First International Conference, ITP 2010, Edinburgh, UK, July 11-14, 2010. Proceedings). Lecture Notes in Computer Science, vol. 6172, Springer, Berlin, pp. 67-82. https://doi.org/10.1007/978-3-642-14052-5_7","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:repository.ubn.ru.nl:2066/84406","is_oa":false,"landing_page_url":"http://hdl.handle.net/2066/84406","pdf_url":null,"source":{"id":"https://openalex.org/S4306401067","display_name":"Radboud Repository (Radboud University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I145872427","host_organization_name":"Radboud University Nijmegen","host_organization_lineage":["https://openalex.org/I145872427"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Kaufmann, M.; Paulson, L. (ed.), Interactive Theorem Proving: First International Conference, ITP 2010 Edinburgh, UK, July 11-14, 2010, Proceedings, pp. 67-82","raw_type":"Article in monograph or in proceedings"},{"id":"pmh:tue:oai:pure.tue.nl:publications/464416ff-b544-4c9d-9c11-b97ac2176bd5","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/464416ff-b544-4c9d-9c11-b97ac2176bd5","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Interactive Theorem Proving (First International Conference, ITP 2010, Edinburgh, UK, July 11-14, 2010. Proceedings), 67 - 82","raw_type":"info:eu-repo/semantics/conferencepaper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1588366745","https://openalex.org/W1597068544","https://openalex.org/W2000205333","https://openalex.org/W2056997919","https://openalex.org/W2124552466","https://openalex.org/W2142302732","https://openalex.org/W2154323564","https://openalex.org/W2158517586","https://openalex.org/W2160344873","https://openalex.org/W2163809172","https://openalex.org/W2499439414","https://openalex.org/W3149674220","https://openalex.org/W3169463464"],"related_works":["https://openalex.org/W2050076411","https://openalex.org/W4226119751","https://openalex.org/W1542183432","https://openalex.org/W2360686363","https://openalex.org/W2001478969","https://openalex.org/W1900787600","https://openalex.org/W2136552483","https://openalex.org/W2166954426","https://openalex.org/W4383684213","https://openalex.org/W2045082154"],"abstract_inverted_index":null,"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}