{"id":"https://openalex.org/W1970485613","doi":"https://doi.org/10.1145/2480759.2480761","title":"Fair Synthesis for Asynchronous Distributed Systems","display_name":"Fair Synthesis for Asynchronous Distributed Systems","publication_year":2013,"publication_date":"2013-06-01","ids":{"openalex":"https://openalex.org/W1970485613","doi":"https://doi.org/10.1145/2480759.2480761","mag":"1970485613"},"language":"en","primary_location":{"id":"doi:10.1145/2480759.2480761","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2480759.2480761","pdf_url":null,"source":{"id":"https://openalex.org/S117153874","display_name":"ACM Transactions on Computational Logic","issn_l":"1529-3785","issn":["1529-3785","1557-945X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computational Logic","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/A5064833291","display_name":"Paul Gastin","orcid":"https://orcid.org/0000-0002-1313-7722"},"institutions":[{"id":"https://openalex.org/I11559806","display_name":"\u00c9cole Normale Sup\u00e9rieure Paris-Saclay","ror":"https://ror.org/00hx6zz33","country_code":"FR","type":"education","lineage":["https://openalex.org/I11559806","https://openalex.org/I277688954"]},{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Paul Gastin","raw_affiliation_strings":["LSV, ENS Cachan, INRIA, CNRS","Modeling and Exploitation of Interaction and Concurrency"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LSV, ENS Cachan, INRIA, CNRS","institution_ids":["https://openalex.org/I11559806","https://openalex.org/I1326498283"]},{"raw_affiliation_string":"Modeling and Exploitation of Interaction and Concurrency","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028032477","display_name":"Nathalie Sznajder","orcid":"https://orcid.org/0000-0002-4199-2443"},"institutions":[{"id":"https://openalex.org/I39804081","display_name":"Sorbonne Universit\u00e9","ror":"https://ror.org/02en5vm52","country_code":"FR","type":"education","lineage":["https://openalex.org/I39804081"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Nathalie Sznajder","raw_affiliation_strings":["LIP6/MoVe, Universit\u00e9 Pierre & Marie Curie, CNRS"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LIP6/MoVe, Universit\u00e9 Pierre & Marie Curie, CNRS","institution_ids":["https://openalex.org/I39804081"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.9281,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.9128007,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"14","issue":"2","first_page":"1","last_page":"31"},"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.9997000098228455,"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.9997000098228455,"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/T11125","display_name":"Petri Nets in System Modeling","score":0.9990000128746033,"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/T10142","display_name":"Formal Methods in Verification","score":0.9988999962806702,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.8001586198806763},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.7521313428878784},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6754466891288757},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5774393081665039},{"id":"https://openalex.org/keywords/communication-source","display_name":"Communication source","score":0.48299896717071533},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.4789572060108185},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.46481025218963623},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4418230652809143},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1700570285320282},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.12910419702529907}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.8001586198806763},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.7521313428878784},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6754466891288757},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5774393081665039},{"id":"https://openalex.org/C198104137","wikidata":"https://www.wikidata.org/wiki/Q974688","display_name":"Communication source","level":2,"score":0.48299896717071533},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.4789572060108185},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.46481025218963623},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4418230652809143},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1700570285320282},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.12910419702529907},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/2480759.2480761","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2480759.2480761","pdf_url":null,"source":{"id":"https://openalex.org/S117153874","display_name":"ACM Transactions on Computational Logic","issn_l":"1529-3785","issn":["1529-3785","1557-945X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computational Logic","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.297.3770","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.297.3770","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://tocl.acm.org/accepted/TOCL-2010-0004.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.396.8659","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.396.8659","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"pmh:oai:HAL:hal-00925735v1","is_oa":false,"landing_page_url":"https://hal.science/hal-00925735","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ACM Transactions on Computational Logic, 2013, 14 (2), pp.9. ⟨10.1145/2480759.2480761⟩","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"},{"id":"https://openalex.org/F4320322263","display_name":"Conseil R\u00e9gional, \u00cele-de-France","ror":"https://ror.org/04ry1rt27"},{"id":"https://openalex.org/F4320334960","display_name":"Seventh Framework Programme","ror":"https://ror.org/00k4n6c32"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":46,"referenced_works":["https://openalex.org/W44066247","https://openalex.org/W78892443","https://openalex.org/W1481594011","https://openalex.org/W1483600339","https://openalex.org/W1490247810","https://openalex.org/W1498342204","https://openalex.org/W1517844372","https://openalex.org/W1525879420","https://openalex.org/W1530410512","https://openalex.org/W1546061844","https://openalex.org/W1547864995","https://openalex.org/W1558344911","https://openalex.org/W1575146467","https://openalex.org/W1596262607","https://openalex.org/W1610578937","https://openalex.org/W1737156267","https://openalex.org/W1783469492","https://openalex.org/W1881260135","https://openalex.org/W2002746187","https://openalex.org/W2003000560","https://openalex.org/W2007981995","https://openalex.org/W2019980178","https://openalex.org/W2024941371","https://openalex.org/W2040127143","https://openalex.org/W2048355938","https://openalex.org/W2054099039","https://openalex.org/W2081163032","https://openalex.org/W2090917162","https://openalex.org/W2093327611","https://openalex.org/W2095620890","https://openalex.org/W2098035530","https://openalex.org/W2111299652","https://openalex.org/W2125267391","https://openalex.org/W2128521545","https://openalex.org/W2148722937","https://openalex.org/W2150447589","https://openalex.org/W2162512015","https://openalex.org/W2172209948","https://openalex.org/W2478857688","https://openalex.org/W2912269296","https://openalex.org/W4212901716","https://openalex.org/W4241612038","https://openalex.org/W6601838453","https://openalex.org/W6603178298","https://openalex.org/W6629841916","https://openalex.org/W6843987763"],"related_works":["https://openalex.org/W2331020993","https://openalex.org/W2972379433","https://openalex.org/W4383764068","https://openalex.org/W1481826604","https://openalex.org/W1797057780","https://openalex.org/W1501430220","https://openalex.org/W3187762542","https://openalex.org/W2993833576","https://openalex.org/W2776877297","https://openalex.org/W3125718803"],"abstract_inverted_index":{"We":[0,73,86,117],"study":[1],"the":[2,42,62,67,84,93,105,132,138,145],"synthesis":[3,47,95,124,139],"problem":[4,48,96],"in":[5],"an":[6,18],"asynchronous":[7],"distributed":[8,98,123,152],"setting:":[9],"a":[10,33,54,70,113,148],"finite":[11],"set":[12],"of":[13,66,107,131,135,151],"processes":[14],"interact":[15],"locally":[16],"with":[17,23,53],"uncontrollable":[19],"environment":[20],"and":[21,36,100,128],"communicate":[22],"each":[24,58],"other":[25],"by":[26,32,41],"sending":[27],"signals":[28],"--":[29],"actions":[30],"controlled":[31],"sender":[34],"process":[35,59],"that":[37,61,119],"are":[38],"immediately":[39],"received":[40],"target":[43],"process.":[44],"The":[45],"fair":[46,64,94],"is":[49,125],"to":[50,83,147],"come":[51],"up":[52],"local":[55],"strategy":[56],"for":[57,91,97,104,122,137],"such":[60],"resulting":[63],"behaviors":[65],"system":[68],"meet":[69],"given":[71],"specification.":[72],"consider":[74],"external":[75],"specifications":[76],"satisfying":[77],"some":[78],"natural":[79],"closure":[80],"properties":[81],"related":[82],"architecture.":[85],"present":[87],"this":[88,120],"new":[89],"setting":[90],"studying":[92],"systems,":[99],"give":[101],"decidability":[102],"results":[103],"subclass":[106],"networks":[108],"where":[109],"communications":[110],"happen":[111],"through":[112],"strongly":[114],"connected":[115],"graph.":[116],"claim":[118],"framework":[121],"natural,":[126],"convenient":[127],"avoids":[129],"most":[130],"usual":[133],"sources":[134],"undecidability":[136],"problem.":[140],"Hence,":[141],"it":[142],"may":[143],"open":[144],"way":[146],"decidable":[149],"theory":[150],"synthesis.":[153]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}