{"id":"https://openalex.org/W1490186282","doi":"https://doi.org/10.2168/lmcs-10(1:4)2014","title":"Linear Temporal Logic for Regular Cost Functions","display_name":"Linear Temporal Logic for Regular Cost Functions","publication_year":2014,"publication_date":"2014-02-04","ids":{"openalex":"https://openalex.org/W1490186282","doi":"https://doi.org/10.2168/lmcs-10(1:4)2014","mag":"1490186282"},"language":"en","primary_location":{"id":"doi:10.2168/lmcs-10(1:4)2014","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-10(1:4)2014","pdf_url":"https://lmcs.episciences.org/1222/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/1222/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5077133539","display_name":"Denis Kuperberg","orcid":"https://orcid.org/0000-0001-5406-717X"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I204730241","display_name":"Universit\u00e9 Paris Cit\u00e9","ror":"https://ror.org/05f82e368","country_code":"FR","type":"education","lineage":["https://openalex.org/I204730241"]},{"id":"https://openalex.org/I4210094115","display_name":"Laboratoire d'Informatique Algorithmique: Fondements et Applications","ror":"https://ror.org/00pbqgm18","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I204730241","https://openalex.org/I4210094115","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Denis Kuperberg","raw_affiliation_strings":["Liafa/CNRS/Universit Paris 7, Denis Diderot, France"],"affiliations":[{"raw_affiliation_string":"Liafa/CNRS/Universit Paris 7, Denis Diderot, France","institution_ids":["https://openalex.org/I204730241","https://openalex.org/I4210094115","https://openalex.org/I1294671590"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5077133539"],"corresponding_institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I204730241","https://openalex.org/I4210094115"],"apc_list":null,"apc_paid":null,"fwci":1.1042,"has_fulltext":true,"cited_by_count":7,"citation_normalized_percentile":{"value":0.76469805,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"Volume 10, Issue 1","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.4803999960422516,"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.4803999960422516,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.17170000076293945,"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/T11567","display_name":"semigroups and automata theory","score":0.11209999769926071,"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.7152099609375},{"id":"https://openalex.org/keywords/linear-temporal-logic","display_name":"Linear temporal logic","score":0.6838425397872925},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.5298815965652466},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5253771543502808},{"id":"https://openalex.org/keywords/temporal-logic","display_name":"Temporal logic","score":0.480601042509079},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4573797881603241},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.4456157684326172},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.4213578999042511},{"id":"https://openalex.org/keywords/dynamic-logic","display_name":"Dynamic logic (digital electronics)","score":0.4146479368209839},{"id":"https://openalex.org/keywords/expressive-power","display_name":"Expressive power","score":0.41389885544776917},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.401274174451828},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3447544574737549},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33800819516181946},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.2225627899169922}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.7152099609375},{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.6838425397872925},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.5298815965652466},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5253771543502808},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.480601042509079},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4573797881603241},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.4456157684326172},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.4213578999042511},{"id":"https://openalex.org/C2777796570","wikidata":"https://www.wikidata.org/wiki/Q2351326","display_name":"Dynamic logic (digital electronics)","level":4,"score":0.4146479368209839},{"id":"https://openalex.org/C195818886","wikidata":"https://www.wikidata.org/wiki/Q5421724","display_name":"Expressive power","level":2,"score":0.41389885544776917},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.401274174451828},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3447544574737549},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33800819516181946},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2225627899169922},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C165801399","wikidata":"https://www.wikidata.org/wiki/Q25428","display_name":"Voltage","level":2,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C172385210","wikidata":"https://www.wikidata.org/wiki/Q5339","display_name":"Transistor","level":3,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.2168/lmcs-10(1:4)2014","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-10(1:4)2014","pdf_url":"https://lmcs.episciences.org/1222/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1401.1448","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1401.1448","pdf_url":"https://arxiv.org/pdf/1401.1448","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":"pmh:oai:HAL:hal-02071071v1","is_oa":true,"landing_page_url":"https://hal.science/hal-02071071","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, 2014, ⟨10.2168/LMCS-10(1:4)2014⟩","raw_type":"Journal articles"},{"id":"pmh:oai:doaj.org/article:6fbb51c6531445bf9fc02d09de1f281a","is_oa":true,"landing_page_url":"https://doaj.org/article/6fbb51c6531445bf9fc02d09de1f281a","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 10, Issue 1 (2014)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.2168/lmcs-10(1:4)2014","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-10(1:4)2014","pdf_url":"https://lmcs.episciences.org/1222/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.6200000047683716,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1490186282.pdf","grobid_xml":"https://content.openalex.org/works/W1490186282.grobid-xml"},"referenced_works_count":11,"referenced_works":["https://openalex.org/W1517238936","https://openalex.org/W2003227046","https://openalex.org/W2033071128","https://openalex.org/W2046829789","https://openalex.org/W2048780543","https://openalex.org/W2095067686","https://openalex.org/W2116250539","https://openalex.org/W2165854715","https://openalex.org/W2172290937","https://openalex.org/W2173598568","https://openalex.org/W3002839602"],"related_works":["https://openalex.org/W2583111156","https://openalex.org/W1494173831","https://openalex.org/W4387188591","https://openalex.org/W946220898","https://openalex.org/W1963128506","https://openalex.org/W4232446061","https://openalex.org/W2143050727","https://openalex.org/W2545777596","https://openalex.org/W3175774282","https://openalex.org/W2585210618"],"abstract_inverted_index":{"Regular":[0],"cost":[1,30,59,75,115],"functions":[2,31,116],"have":[3],"been":[4],"introduced":[5,117],"recently":[6],"as":[7,90],"an":[8,47,63],"extension":[9,48],"to":[10,57,70],"the":[11,81,93,96,103],"notion":[12],"of":[13,29,49,74,106],"regular":[14],"languages":[15],"with":[16],"counting":[17],"capabilities,":[18],"which":[19],"retains":[20],"strong":[21],"closure,":[22],"equivalence,":[23],"and":[24,77],"decidability":[25],"properties.":[26],"The":[27],"specificity":[28],"is":[32,92],"that":[33,80],"exact":[34],"values":[35],"are":[36,88],"not":[37],"considered,":[38],"but":[39],"only":[40],"estimated.":[41],"In":[42],"this":[43,67,86,107,119],"paper,":[44],"we":[45,78],"define":[46],"Linear":[50],"Temporal":[51],"Logic":[52],"(LTL)":[53],"over":[54],"finite":[55],"words":[56],"describe":[58],"functions.":[60],"We":[61,99],"give":[62],"explicit":[64],"translation":[65],"from":[66],"new":[68,111],"logic":[69,87],"two":[71],"dual":[72],"form":[73],"automata,":[76],"show":[79],"natural":[82],"decision":[83],"problems":[84],"for":[85,114],"PSPACE-complete,":[89],"it":[91],"case":[94],"in":[95,118],"classical":[97],"setting.":[98],"then":[100],"algebraically":[101],"characterize":[102],"expressive":[104],"power":[105],"logic,":[108],"using":[109],"a":[110],"syntactic":[112],"congruence":[113],"paper.":[120]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}