{"id":"https://openalex.org/W1978510523","doi":"https://doi.org/10.1109/tac.2014.2381451","title":"Optimal Temporal Logic Control for Deterministic Transition Systems With Probabilistic Penalties","display_name":"Optimal Temporal Logic Control for Deterministic Transition Systems With Probabilistic Penalties","publication_year":2015,"publication_date":"2015-01-06","ids":{"openalex":"https://openalex.org/W1978510523","doi":"https://doi.org/10.1109/tac.2014.2381451","mag":"1978510523"},"language":"en","primary_location":{"id":"doi:10.1109/tac.2014.2381451","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tac.2014.2381451","pdf_url":null,"source":{"id":"https://openalex.org/S184954342","display_name":"IEEE Transactions on Automatic Control","issn_l":"0018-9286","issn":["0018-9286","1558-2523","2334-3303"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Automatic Control","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/A5089563210","display_name":"M\u00e1ria Svore\u0148ov\u00e1","orcid":null},"institutions":[{"id":"https://openalex.org/I21449261","display_name":"Masaryk University","ror":"https://ror.org/02j46qs45","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21449261"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"Maria Svorenova","raw_affiliation_strings":["Faculty of Informatics, Masaryk University, Brno, Czech Republic","Fac. of Inf., Masaryk Univ., Brno, , Czech Republic"],"affiliations":[{"raw_affiliation_string":"Faculty of Informatics, Masaryk University, Brno, Czech Republic","institution_ids":["https://openalex.org/I21449261"]},{"raw_affiliation_string":"Fac. of Inf., Masaryk Univ., Brno, , Czech Republic","institution_ids":["https://openalex.org/I21449261"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014178090","display_name":"Ivana \u010cern\u00e1","orcid":"https://orcid.org/0000-0002-0711-9552"},"institutions":[{"id":"https://openalex.org/I21449261","display_name":"Masaryk University","ror":"https://ror.org/02j46qs45","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21449261"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Ivana Cerna","raw_affiliation_strings":["Faculty of Informatics, Masaryk University, Brno, Czech Republic","Fac. of Inf., Masaryk Univ., Brno, , Czech Republic"],"affiliations":[{"raw_affiliation_string":"Faculty of Informatics, Masaryk University, Brno, Czech Republic","institution_ids":["https://openalex.org/I21449261"]},{"raw_affiliation_string":"Fac. of Inf., Masaryk Univ., Brno, , Czech Republic","institution_ids":["https://openalex.org/I21449261"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086742095","display_name":"C\u0103lin Belta","orcid":"https://orcid.org/0000-0002-7141-2657"},"institutions":[{"id":"https://openalex.org/I111088046","display_name":"Boston University","ror":"https://ror.org/05qwgg493","country_code":"US","type":"education","lineage":["https://openalex.org/I111088046"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Calin Belta","raw_affiliation_strings":["Department of Mechanical Engineering and Division of Systems Engineering, Boston University, Boston, MA, USA","Dept. of Mech. Eng., Boston Univ., Boston, MA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Mechanical Engineering and Division of Systems Engineering, Boston University, Boston, MA, USA","institution_ids":["https://openalex.org/I111088046"]},{"raw_affiliation_string":"Dept. of Mech. Eng., Boston Univ., Boston, MA, USA","institution_ids":["https://openalex.org/I111088046"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5089563210"],"corresponding_institution_ids":["https://openalex.org/I21449261"],"apc_list":null,"apc_paid":null,"fwci":1.0515,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.78268749,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"60","issue":"6","first_page":"1528","last_page":"1541"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.998199999332428,"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.998199999332428,"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/T10791","display_name":"Advanced Control Systems Optimization","score":0.9879999756813049,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.9807999730110168,"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/probabilistic-logic","display_name":"Probabilistic logic","score":0.681454598903656},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6681938171386719},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6231110692024231},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6057755947113037},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.5908774137496948},{"id":"https://openalex.org/keywords/linear-temporal-logic","display_name":"Linear temporal logic","score":0.5876660346984863},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5715172290802002},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.5508424043655396},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.548478901386261},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.48864561319351196},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.4854007661342621},{"id":"https://openalex.org/keywords/temporal-logic","display_name":"Temporal logic","score":0.457507848739624},{"id":"https://openalex.org/keywords/transition-system","display_name":"Transition system","score":0.45735353231430054},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4268012046813965},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.42246925830841064},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.42244020104408264},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.28490149974823},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2578963041305542},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11833414435386658}],"concepts":[{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.681454598903656},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6681938171386719},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6231110692024231},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6057755947113037},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.5908774137496948},{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.5876660346984863},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5715172290802002},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.5508424043655396},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.548478901386261},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.48864561319351196},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.4854007661342621},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.457507848739624},{"id":"https://openalex.org/C2779167558","wikidata":"https://www.wikidata.org/wiki/Q176468","display_name":"Transition system","level":2,"score":0.45735353231430054},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4268012046813965},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.42246925830841064},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.42244020104408264},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.28490149974823},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2578963041305542},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11833414435386658},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tac.2014.2381451","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tac.2014.2381451","pdf_url":null,"source":{"id":"https://openalex.org/S184954342","display_name":"IEEE Transactions on Automatic Control","issn_l":"0018-9286","issn":["0018-9286","1558-2523","2334-3303"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Automatic Control","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.7799999713897705}],"awards":[{"id":"https://openalex.org/G1789468185","display_name":null,"funder_award_id":"CNS-1035588","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4661511793","display_name":null,"funder_award_id":"GAP202/11/0312","funder_id":"https://openalex.org/F4320326548","funder_display_name":"Masarykova Univerzita"},{"id":"https://openalex.org/G4810159703","display_name":null,"funder_award_id":"LH11065","funder_id":"https://openalex.org/F4320326548","funder_display_name":"Masarykova Univerzita"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320326548","display_name":"Masarykova Univerzita","ror":"https://ror.org/02j46qs45"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":41,"referenced_works":["https://openalex.org/W61606928","https://openalex.org/W117911312","https://openalex.org/W1488782959","https://openalex.org/W1498432697","https://openalex.org/W1507116188","https://openalex.org/W1859458367","https://openalex.org/W1943821960","https://openalex.org/W1990609140","https://openalex.org/W2000559735","https://openalex.org/W2001914359","https://openalex.org/W2012947775","https://openalex.org/W2036772106","https://openalex.org/W2041960188","https://openalex.org/W2044323243","https://openalex.org/W2061372038","https://openalex.org/W2069888227","https://openalex.org/W2073384958","https://openalex.org/W2079042739","https://openalex.org/W2089003125","https://openalex.org/W2098432798","https://openalex.org/W2110915954","https://openalex.org/W2112895077","https://openalex.org/W2117927826","https://openalex.org/W2150335178","https://openalex.org/W2152784531","https://openalex.org/W2154136656","https://openalex.org/W2158345050","https://openalex.org/W2165364079","https://openalex.org/W2169289043","https://openalex.org/W2185277641","https://openalex.org/W2534652523","https://openalex.org/W2950411015","https://openalex.org/W2970873286","https://openalex.org/W3102958032","https://openalex.org/W3103706207","https://openalex.org/W4299401133","https://openalex.org/W6604906561","https://openalex.org/W6629289599","https://openalex.org/W6639015652","https://openalex.org/W6650365267","https://openalex.org/W6676638128"],"related_works":["https://openalex.org/W4297909958","https://openalex.org/W2962728842","https://openalex.org/W2951033492","https://openalex.org/W117911312","https://openalex.org/W2097439419","https://openalex.org/W4221157702","https://openalex.org/W4226143744","https://openalex.org/W2734058336","https://openalex.org/W3080730120","https://openalex.org/W3090827750"],"abstract_inverted_index":{"We":[0,136],"consider":[1],"an":[2],"optimal":[3,80],"control":[4],"problem":[5],"for":[6],"a":[7,15,19,58,77,138],"weighted":[8],"deterministic":[9],"transition":[10],"system":[11,35],"required":[12],"to":[13,46,71,116],"satisfy":[14],"constraint":[16],"expressed":[17],"as":[18,40],"linear":[20],"temporal":[21],"logic":[22],"(LTL)":[23],"formula":[24],"over":[25],"its":[26],"labels.":[27],"By":[28],"assuming":[29],"that":[30,87,101],"the":[31,34,48,83,108,125,133,142],"executions":[32],"of":[33,57,85,92,105,124,141,147],"incur":[36],"time-varying":[37],"penalties":[38,93],"modeled":[39],"Markov":[41],"chains,":[42],"our":[43],"goal":[44],"is":[45],"minimize":[47],"expected":[49],"average":[50],"cumulative":[51],"penalty":[52],"incurred":[53],"between":[54],"consecutive":[55],"satisfactions":[56],"desired":[59],"property.":[60],"Using":[61],"concepts":[62],"from":[63],"theoretical":[64],"computer":[65],"science,":[66],"we":[67,75,99,110,128],"provide":[68,137],"two":[69,148],"solutions":[70],"this":[72],"problem.":[73],"First,":[74],"derive":[76],"provably":[78],"correct":[79],"strategy":[81],"within":[82],"class":[84],"strategies":[86,114],"do":[88],"not":[89],"exploit":[90],"values":[91],"sensed":[94],"in":[95,132],"real":[96],"time.":[97],"Second,":[98],"show":[100],"by":[102],"taking":[103],"advantage":[104],"locally":[106],"sensing":[107],"penalties,":[109],"can":[111],"construct":[112],"heuristic":[113],"leading":[115],"lower":[117],"collected":[118],"penalty.":[119],"While":[120],"still":[121],"ensuring":[122],"satisfaction":[123],"LTL":[126],"constraint,":[127],"cannot":[129],"guarantee":[130],"optimality":[131],"latter":[134],"case.":[135],"user-friendly":[139],"implementation":[140],"proposed":[143],"algorithms":[144],"and":[145],"analysis":[146],"case":[149],"studies.":[150]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
