{"id":"https://openalex.org/W2978328085","doi":"https://doi.org/10.1007/s00236-019-00348-4","title":"Reactive synthesis with maximum realizability of linear temporal logic specifications","display_name":"Reactive synthesis with maximum realizability of linear temporal logic specifications","publication_year":2019,"publication_date":"2019-11-09","ids":{"openalex":"https://openalex.org/W2978328085","doi":"https://doi.org/10.1007/s00236-019-00348-4","mag":"2978328085"},"language":"en","primary_location":{"id":"doi:10.1007/s00236-019-00348-4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00236-019-00348-4","pdf_url":null,"source":{"id":"https://openalex.org/S84409463","display_name":"Acta Informatica","issn_l":"0001-5903","issn":["0001-5903","1432-0525"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Acta Informatica","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1910.02561","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5059464456","display_name":"Rayna Dimitrova","orcid":"https://orcid.org/0009-0006-2494-8690"},"institutions":[{"id":"https://openalex.org/I153648349","display_name":"University of Leicester","ror":"https://ror.org/04h699437","country_code":"GB","type":"education","lineage":["https://openalex.org/I153648349"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Rayna Dimitrova","raw_affiliation_strings":["University of Leicester, Leicester, UK","*University of Leicester"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Leicester, Leicester, UK","institution_ids":["https://openalex.org/I153648349"]},{"raw_affiliation_string":"*University of Leicester","institution_ids":["https://openalex.org/I153648349"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101793459","display_name":"Mahsa Ghasemi","orcid":"https://orcid.org/0000-0003-4302-4806"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mahsa Ghasemi","raw_affiliation_strings":["University of Texas at Austin, Austin, TX, USA","University of Texas at Austin"],"raw_orcid":"https://orcid.org/0000-0003-4302-4806","affiliations":[{"raw_affiliation_string":"University of Texas at Austin, Austin, TX, USA","institution_ids":["https://openalex.org/I86519309"]},{"raw_affiliation_string":"University of Texas at Austin","institution_ids":["https://openalex.org/I86519309"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5068441112","display_name":"Ufuk Topcu","orcid":"https://orcid.org/0000-0003-0819-9985"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ufuk Topcu","raw_affiliation_strings":["University of Texas at Austin, Austin, TX, USA","University of Texas at Austin"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Texas at Austin, Austin, TX, USA","institution_ids":["https://openalex.org/I86519309"]},{"raw_affiliation_string":"University of Texas at Austin","institution_ids":["https://openalex.org/I86519309"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2990,"currency":"USD","value_usd":2990},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.16035324,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"57","issue":"1-2","first_page":"107","last_page":"135"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998999834060669,"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.9998999834060669,"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/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.996399998664856,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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.9944999814033508,"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/realizability","display_name":"Realizability","score":0.8644043803215027},{"id":"https://openalex.org/keywords/linear-temporal-logic","display_name":"Linear temporal logic","score":0.7082858681678772},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6585202217102051},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.6458078026771545},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.6074694395065308},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.564022958278656},{"id":"https://openalex.org/keywords/temporal-logic","display_name":"Temporal logic","score":0.5241416096687317},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5083314776420593},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.47650590538978577},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.470688134431839},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.44322171807289124},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.43241047859191895},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.4300786256790161},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.405828595161438},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.29763263463974},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26696282625198364}],"concepts":[{"id":"https://openalex.org/C2776378722","wikidata":"https://www.wikidata.org/wiki/Q3454417","display_name":"Realizability","level":2,"score":0.8644043803215027},{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.7082858681678772},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6585202217102051},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.6458078026771545},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.6074694395065308},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.564022958278656},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.5241416096687317},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5083314776420593},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.47650590538978577},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.470688134431839},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.44322171807289124},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.43241047859191895},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.4300786256790161},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.405828595161438},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.29763263463974},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26696282625198364},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","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":6,"locations":[{"id":"doi:10.1007/s00236-019-00348-4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00236-019-00348-4","pdf_url":null,"source":{"id":"https://openalex.org/S84409463","display_name":"Acta Informatica","issn_l":"0001-5903","issn":["0001-5903","1432-0525"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Acta Informatica","raw_type":"journal-article"},{"id":"pmh:oai:eprints.whiterose.ac.uk:156772","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306400854","display_name":"White Rose Research Online (University of Leeds, The University of Sheffield, University of York)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2800616092","host_organization_name":"White Rose University Consortium","host_organization_lineage":["https://openalex.org/I2800616092"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Article"},{"id":"pmh:oai:arXiv.org:1910.02561","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1910.02561","pdf_url":"https://arxiv.org/pdf/1910.02561","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"mag:2978328085","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1910.02561","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"pmh:oai:figshare.com:article/11380137","is_oa":true,"landing_page_url":"https://figshare.com/articles/journal_contribution/Reactive_synthesis_with_maximum_realizability_of_linear_temporal_logic_specifications/11380137","pdf_url":null,"source":{"id":"https://openalex.org/S4306402621","display_name":"INDIGO (University of Illinois at Chicago)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I39422238","host_organization_name":"University of Illinois Chicago","host_organization_lineage":["https://openalex.org/I39422238"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},{"id":"doi:10.48550/arxiv.1910.02561","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1910.02561","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1910.02561","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1910.02561","pdf_url":"https://arxiv.org/pdf/1910.02561","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[{"score":0.5299999713897705,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[{"id":"https://openalex.org/G1234682391","display_name":null,"funder_award_id":"UTC 17-S8401-10-C1","funder_id":"https://openalex.org/F4320338294","funder_display_name":"Air Force Research Laboratory"},{"id":"https://openalex.org/G1443907517","display_name":null,"funder_award_id":"N000141613165","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"},{"id":"https://openalex.org/G1479153534","display_name":null,"funder_award_id":"FA8650-15-C-2546","funder_id":"https://openalex.org/F4320338294","funder_display_name":"Air Force Research Laboratory"},{"id":"https://openalex.org/G7829835590","display_name":"EXPLAINABLE AND SCALABLE PLANNING WITH PROBABILISTIC TEMPORAL LOGIC SPECIFICATIONS THE OBJECTIVE OF THIS PROPOSAL IS TO DEVELOP THEORY  ALGORITHMS AND DEMONSTRATIONS FOR FORMAL SPECIFICATIONS AND AUTOMATED SYNTHESIS AND LEARNING OF AUTONOMY PROTOCOLS FOR MISSION  RESOURCE AND CONTINGENCY MANAGEMENT. WE PARTITION THE EFFORT INTO THREE THRUSTS: (I) COMPOSITIONAL AND HIERARCHICAL SYNTHESIS -- DEVELOP METHODS FOR AUTOMATED SYNTHESIS FROM PROBABILISTIC TEMPORAL LOGIC SPECIFICATIONS. (II) INTERPRETABLE PLANS -- DEVELOP AUTOMATA-LEARNING METHODS TO SYNTHESIZE HUMAN-INTERPRETABLE PLANS FOR PRACTICALLY INFINITE-STATE SYSTEMS. (III) EXPLAINABLE FEEDBACK -- IN CASES IN WHICH THERE IS NO ACCEPTABLE PLAN  DEVELOP EXPLANATIONS OF THE CORE REASONS IN TERMS UNDERSTANDABLE BY HUMANS. ALL THREE THRUSTS ADDRESS SCALABILITY EXPLICITLY THROUGH A SERIES OF ALGORITHMIC AND ARCHITECTURAL MEASURES. IN PARALLEL WITH THE TECHNICAL THRUSTS  WE WILL DEMONSTRATE AND SPECIALIZE OUR ALGORITHMS IN A CASE STUDY ON HUMAN SPACEFLIGHT OPERATIONS. WE DESIGNED OUR TECHNICAL THRUSTS TO BALANCE THEIR GENERAL APPLICABILITY AND THEIR IMPACT AND TIMELINESS FOR HUMAN SPACEFLIGHT OPERATIONS. OUR EFFORT INTRODUCES A PARADIGM SHIFT IN THE PLANNING-EXECUTION (AND RE-PLANNING) LOOP BY ADDRESSING A NUMBER OF THESE CHALLENGES. OUR EMPHASIS PARTICULARLY ON UNAMBIGUOUS  FORMAL SPECIFICATIONS AND COMPILATION OF EXECUTABLE CONTROL SOFTWARE WITH PROVABLE GUARANTEES AND SYSTEMATIC  SENSITIVITY ANALYSIS DIFFUSES THE CRITICAL CONCERN OF RELIABILITY THROUGHOUT THE PLANNING-EXECUTION LOOP. FURTHERMORE  THE PROPOSED ALGORITHMS WILL INCORPORATE MODELS WITH STOCHASTIC AS WELL AS NONDETERMINISTIC UNCERTAINTIES AND RICH SPECIFICATIONS WITH TEMPORAL AND LOGICAL RELATIONS AS WELL AS PROBABILISTIC AND REAL-TIME MODALITIES AS NEEDED. INTEGRATED PLANNING FOR THE COUPLED FUNCTIONS INTRODUCES POSSIBILITIES FOR SYSTEM-LEVEL OPTIMIZATION  E.G.  IN PERFORMANCE  WEIGHTS AND OVERALL COST. FINALLY  THE PROPOSED ALGORITHMIC AND ARCHITECTURAL ADVANCES WILL IMPROVE NOT ONLY THE SCALABILITY OF THE RESULTING SYNTHESIS ALGORITHMS BUT ALSO THEIR INTERPRETABILITY BY AND EXPLAINABILITY TO THE CREW AND DESIGNERS.","funder_award_id":"NNX17AD04G","funder_id":"https://openalex.org/F4320306101","funder_display_name":"National Aeronautics and Space Administration"}],"funders":[{"id":"https://openalex.org/F4320306101","display_name":"National Aeronautics and Space Administration","ror":"https://ror.org/027ka1x80"},{"id":"https://openalex.org/F4320337345","display_name":"Office of Naval Research","ror":"https://ror.org/00rk2pe57"},{"id":"https://openalex.org/F4320338294","display_name":"Air Force Research Laboratory","ror":"https://ror.org/02e2egq70"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W1498432697","https://openalex.org/W1537589219","https://openalex.org/W1540883472","https://openalex.org/W1582497976","https://openalex.org/W1603488308","https://openalex.org/W1786377004","https://openalex.org/W1825789089","https://openalex.org/W1910194412","https://openalex.org/W1927741686","https://openalex.org/W2019261678","https://openalex.org/W2023808162","https://openalex.org/W2027175684","https://openalex.org/W2145001295","https://openalex.org/W2149150933","https://openalex.org/W2150447589","https://openalex.org/W2154593562","https://openalex.org/W2155327357","https://openalex.org/W2182989809","https://openalex.org/W2185680923","https://openalex.org/W2381901500","https://openalex.org/W2425244199","https://openalex.org/W2522043470","https://openalex.org/W2528851098","https://openalex.org/W2569030807","https://openalex.org/W2600686309","https://openalex.org/W2963650758","https://openalex.org/W2964122198","https://openalex.org/W4241616303","https://openalex.org/W4253380258"],"related_works":["https://openalex.org/W2987958996","https://openalex.org/W3125196057","https://openalex.org/W1742255754","https://openalex.org/W2506730751","https://openalex.org/W1845519667","https://openalex.org/W2883588720","https://openalex.org/W2005484623","https://openalex.org/W3038240115","https://openalex.org/W2918184689","https://openalex.org/W3127708129","https://openalex.org/W2901054789","https://openalex.org/W1835313181","https://openalex.org/W2902726917","https://openalex.org/W2048780543","https://openalex.org/W2023329406","https://openalex.org/W2294184790","https://openalex.org/W2011674996","https://openalex.org/W1583251282","https://openalex.org/W1759329707","https://openalex.org/W2951717602"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2022-07-28T00:00:00"}