{"id":"https://openalex.org/W4392240364","doi":"https://doi.org/10.1145/3648473","title":"The Complexity of LTL Rational Synthesis","display_name":"The Complexity of LTL Rational Synthesis","publication_year":2024,"publication_date":"2024-02-28","ids":{"openalex":"https://openalex.org/W4392240364","doi":"https://doi.org/10.1145/3648473"},"language":"en","primary_location":{"id":"doi:10.1145/3648473","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1145/3648473","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3648473","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":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3648473","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5077429082","display_name":"Orna Kupferman","orcid":"https://orcid.org/0000-0003-4699-6117"},"institutions":[{"id":"https://openalex.org/I197251160","display_name":"Hebrew University of Jerusalem","ror":"https://ror.org/03qxff017","country_code":"IL","type":"education","lineage":["https://openalex.org/I197251160"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Orna Kupferman","raw_affiliation_strings":["The Hebrew University, Jerusalem, Israel"],"affiliations":[{"raw_affiliation_string":"The Hebrew University, Jerusalem, Israel","institution_ids":["https://openalex.org/I197251160"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022823596","display_name":"Noam Shenwald","orcid":"https://orcid.org/0000-0003-1994-6835"},"institutions":[{"id":"https://openalex.org/I197251160","display_name":"Hebrew University of Jerusalem","ror":"https://ror.org/03qxff017","country_code":"IL","type":"education","lineage":["https://openalex.org/I197251160"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Noam Shenwald","raw_affiliation_strings":["The Hebrew University, Jerusalem, Israel"],"affiliations":[{"raw_affiliation_string":"The Hebrew University, Jerusalem, Israel","institution_ids":["https://openalex.org/I197251160"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5077429082"],"corresponding_institution_ids":["https://openalex.org/I197251160"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.03262669,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"25","issue":"2","first_page":"1","last_page":"31"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998000264167786,"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":0.9998000264167786,"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.9976000189781189,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9961000084877014,"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/linear-temporal-logic","display_name":"Linear temporal logic","score":0.6621014475822449},{"id":"https://openalex.org/keywords/temporal-logic","display_name":"Temporal logic","score":0.5149950981140137},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.464056134223938},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.46189984679222107},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4560605585575104},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.45154544711112976},{"id":"https://openalex.org/keywords/parametric-statistics","display_name":"Parametric statistics","score":0.4462856650352478},{"id":"https://openalex.org/keywords/rational-number","display_name":"Rational number","score":0.42017412185668945},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.41495281457901},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.33459433913230896},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.16339093446731567}],"concepts":[{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.6621014475822449},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.5149950981140137},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.464056134223938},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.46189984679222107},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4560605585575104},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.45154544711112976},{"id":"https://openalex.org/C117251300","wikidata":"https://www.wikidata.org/wiki/Q1849855","display_name":"Parametric statistics","level":2,"score":0.4462856650352478},{"id":"https://openalex.org/C46875033","wikidata":"https://www.wikidata.org/wiki/Q1244890","display_name":"Rational number","level":2,"score":0.42017412185668945},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.41495281457901},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33459433913230896},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.16339093446731567},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"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":1,"locations":[{"id":"doi:10.1145/3648473","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1145/3648473","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3648473","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"}],"best_oa_location":{"id":"doi:10.1145/3648473","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1145/3648473","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3648473","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"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4392240364.pdf","grobid_xml":"https://content.openalex.org/works/W4392240364.grobid-xml"},"referenced_works_count":23,"referenced_works":["https://openalex.org/W1496672808","https://openalex.org/W1499127572","https://openalex.org/W1515863024","https://openalex.org/W1970603830","https://openalex.org/W2016206563","https://openalex.org/W2033071128","https://openalex.org/W2048905609","https://openalex.org/W2067050450","https://openalex.org/W2125537511","https://openalex.org/W2150447589","https://openalex.org/W2163151383","https://openalex.org/W2167101557","https://openalex.org/W2262389240","https://openalex.org/W2473183186","https://openalex.org/W2487893106","https://openalex.org/W2508573783","https://openalex.org/W2531563875","https://openalex.org/W2791557958","https://openalex.org/W2912248071","https://openalex.org/W2912494578","https://openalex.org/W2972772721","https://openalex.org/W3174868852","https://openalex.org/W4241108585"],"related_works":["https://openalex.org/W2124110813","https://openalex.org/W3021103820","https://openalex.org/W2763487042","https://openalex.org/W2521108391","https://openalex.org/W1532447905","https://openalex.org/W2031188261","https://openalex.org/W4285022830","https://openalex.org/W4232446061","https://openalex.org/W2077520193","https://openalex.org/W1513400763"],"abstract_inverted_index":{"In":[0],"rational":[1,16,37,112],"synthesis":[2,113],",":[3],"we":[4,55,77,107],"automatically":[5],"construct":[6],"a":[7],"reactive":[8],"system":[9,97],"that":[10,20,63],"satisfies":[11],"its":[12],"specification":[13],"in":[14,46,67,84,130],"all":[15],"environments,":[17],"namely":[18],"environments":[19],"have":[21],"objectives":[22,41,94,101],"and":[23,76,81,99,121,126],"act":[24],"to":[25,118],"fulfill":[26],"them.":[27],"We":[28],"complete":[29],"the":[30,33,40,57,87,90,93,96,100,103,109,119,124],"study":[31],"of":[32,35,86,95,102,111],"complexity":[34,72],"LTL":[36],"synthesis,":[38],"when":[39],"are":[42],"given":[43],"by":[44,114,122],"formulas":[45],"Linear":[47],"Temporal":[48],"Logic.":[49],"Our":[50],"contribution":[51],"is":[52,74],"threefold.":[53],"First,":[54],"tighten":[56],"known":[58],"upper":[59,80],"bounds":[60,83],"for":[61],"settings":[62],"were":[64],"left":[65],"open":[66],"earlier":[68,131],"work.":[69,132],"Second,":[70],"our":[71],"analysis":[73],"parametric,":[75],"describe":[78],"tight":[79],"lower":[82],"each":[85],"problem":[88],"parameters:":[89],"game":[91],"graph,":[92],"components,":[98],"environment":[104],"components.":[105],"Third,":[106],"generalize":[108],"definition":[110],"adding":[115],"hostile":[116],"players":[117],"setting":[120],"combining":[123],"cooperative":[125],"non-cooperative":[127],"approaches":[128],"studied":[129]},"counts_by_year":[],"updated_date":"2025-12-25T23:11:45.687758","created_date":"2025-10-10T00:00:00"}