{"id":"https://openalex.org/W2611610691","doi":"https://doi.org/10.23638/lmcs-15(3:33)2019","title":"The Complexity of Flat Freeze LTL","display_name":"The Complexity of Flat Freeze LTL","publication_year":2019,"publication_date":"2019-09-30","ids":{"openalex":"https://openalex.org/W2611610691","doi":"https://doi.org/10.23638/lmcs-15(3:33)2019","mag":"2611610691"},"language":"en","primary_location":{"id":"doi:10.23638/lmcs-15(3:33)2019","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-15(3:33)2019","pdf_url":"https://lmcs.episciences.org/5795/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":"preprint","indexed_in":["arxiv","crossref","datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/5795/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5082538918","display_name":"Benedikt Bollig","orcid":"https://orcid.org/0000-0003-0985-6115"},"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/I4210104198","display_name":"Laboratoire Sp\u00e9cification et V\u00e9rification","ror":"https://ror.org/01kz1bj67","country_code":"FR","type":"facility","lineage":["https://openalex.org/I11559806","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I277688954","https://openalex.org/I4210104198","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Benedikt Bollig","raw_affiliation_strings":["Laboratoire Sp\u00e9cification et V\u00e9rification [Cachan]","Centre National de la Recherche Scientifique"],"affiliations":[{"raw_affiliation_string":"Laboratoire Sp\u00e9cification et V\u00e9rification [Cachan]","institution_ids":["https://openalex.org/I4210104198"]},{"raw_affiliation_string":"Centre National de la Recherche Scientifique","institution_ids":["https://openalex.org/I1294671590"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5066136949","display_name":"Karin Quaas","orcid":null},"institutions":[{"id":"https://openalex.org/I926574661","display_name":"Leipzig University","ror":"https://ror.org/03s7gtk40","country_code":"DE","type":"education","lineage":["https://openalex.org/I926574661"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Karin Quaas","raw_affiliation_strings":["Universit\u00e4t Leipzig"],"affiliations":[{"raw_affiliation_string":"Universit\u00e4t Leipzig","institution_ids":["https://openalex.org/I926574661"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5040637644","display_name":"Arnaud Sangnier","orcid":"https://orcid.org/0000-0002-6731-0340"},"institutions":[{"id":"https://openalex.org/I4210117673","display_name":"Institut de Recherche en Informatique Fondamentale","ror":"https://ror.org/02krdtz55","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I204730241","https://openalex.org/I4210089394","https://openalex.org/I4210117673","https://openalex.org/I4210139971"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Arnaud Sangnier","raw_affiliation_strings":["Institut de Recherche en Informatique Fondamentale"],"affiliations":[{"raw_affiliation_string":"Institut de Recherche en Informatique Fondamentale","institution_ids":["https://openalex.org/I4210117673"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5082538918"],"corresponding_institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I4210104198"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00598073,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"Volume 15, Issue 3","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.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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9976000189781189,"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.9882000088691711,"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/undecidable-problem","display_name":"Undecidable problem","score":0.8194435238838196},{"id":"https://openalex.org/keywords/unary-operation","display_name":"Unary operation","score":0.7841373682022095},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.7236847281455994},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.7112693190574646},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.6500004529953003},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.6462591886520386},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5534604787826538},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.5318068265914917},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.49724677205085754},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.44902053475379944},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4483708441257477},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.44294920563697815},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39531201124191284},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3686807155609131},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.36200857162475586},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.24671730399131775}],"concepts":[{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.8194435238838196},{"id":"https://openalex.org/C78023250","wikidata":"https://www.wikidata.org/wiki/Q657596","display_name":"Unary operation","level":2,"score":0.7841373682022095},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.7236847281455994},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.7112693190574646},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.6500004529953003},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.6462591886520386},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5534604787826538},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.5318068265914917},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.49724677205085754},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.44902053475379944},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4483708441257477},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.44294920563697815},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39531201124191284},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3686807155609131},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.36200857162475586},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.24671730399131775},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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":3,"locations":[{"id":"doi:10.23638/lmcs-15(3:33)2019","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-15(3:33)2019","pdf_url":"https://lmcs.episciences.org/5795/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:1609.06124","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1609.06124","pdf_url":"https://arxiv.org/pdf/1609.06124","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":"doi:10.48550/arxiv.1609.06124","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1609.06124","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"doi:10.23638/lmcs-15(3:33)2019","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-15(3:33)2019","pdf_url":"https://lmcs.episciences.org/5795/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":[],"awards":[{"id":"https://openalex.org/G1913145437","display_name":null,"funder_award_id":"QU 316/1-2","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G267646467","display_name":null,"funder_award_id":"ANR-14-CE28-000","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G4393859392","display_name":null,"funder_award_id":"ANR-14-CE28-0002","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"},{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2611610691.pdf","grobid_xml":"https://content.openalex.org/works/W2611610691.grobid-xml"},"referenced_works_count":30,"referenced_works":["https://openalex.org/W203022780","https://openalex.org/W821240578","https://openalex.org/W1524128696","https://openalex.org/W1532209667","https://openalex.org/W1542921761","https://openalex.org/W1544182777","https://openalex.org/W1550659912","https://openalex.org/W1602384540","https://openalex.org/W1721793416","https://openalex.org/W1809956864","https://openalex.org/W1816892670","https://openalex.org/W1855380557","https://openalex.org/W1855477342","https://openalex.org/W1946664948","https://openalex.org/W2000084497","https://openalex.org/W2025782239","https://openalex.org/W2036684363","https://openalex.org/W2073614038","https://openalex.org/W2078894460","https://openalex.org/W2111714843","https://openalex.org/W2115082275","https://openalex.org/W2124876285","https://openalex.org/W2167135424","https://openalex.org/W2167907675","https://openalex.org/W2177814128","https://openalex.org/W2215731810","https://openalex.org/W2254409895","https://openalex.org/W2296504218","https://openalex.org/W2513871081","https://openalex.org/W2962748292"],"related_works":["https://openalex.org/W2020140696","https://openalex.org/W2584984136","https://openalex.org/W2591956186","https://openalex.org/W2099490078","https://openalex.org/W1553002193","https://openalex.org/W1805200712","https://openalex.org/W1563786920","https://openalex.org/W2951140680","https://openalex.org/W2912654482","https://openalex.org/W1993478572"],"abstract_inverted_index":{"We":[0,177],"consider":[1],"the":[2,17,43,53,61,64,103,130,160,202],"model-checking":[3,44],"problem":[4,45,104,132],"for":[5,80,170],"freeze":[6,18,57,65,82],"LTL":[7,13,15,83],"on":[8,52,84,126,159,189],"one-counter":[9],"automata":[10,150,211],"(OCA).":[11],"Freeze":[12],"extends":[14],"with":[16,39,86,135,174,212],"quantifier,":[19],"which":[20,60],"allows":[21],"one":[22,40,196,213],"to":[23,129],"store":[24],"different":[25],"counter":[26,90,112],"values":[27,162],"of":[28,56,63,89,201],"a":[29,70,127,183,190],"run":[30],"in":[31,48,59,95,106,116,133,172,207,217],"registers":[32],"so":[33],"that":[34,77,102,143,163,205],"they":[35],"can":[36],"be":[37],"compared":[38],"another.":[41],"As":[42,185],"is":[46,67,92,142,216],"undecidable":[47],"general,":[49],"we":[50,100,124,144,164],"focus":[51],"flat":[54,81],"fragment":[55],"LTL,":[58],"usage":[62],"quantifier":[66],"restricted.":[68],"In":[69,97],"previous":[71],"work,":[72],"Lechner":[73,121],"et":[74,122],"al.":[75],"showed":[76],"model":[78],"checking":[79],"OCA":[85,134],"binary":[87],"encoding":[88],"updates":[91,113],"decidable":[93],"and":[94,194],"2NEXPTIME.":[96],"this":[98],"paper,":[99],"prove":[101],"is,":[105],"fact,":[107],"NEXPTIME-complete":[108],"no":[109],"matter":[110],"whether":[111],"are":[114],"encoded":[115],"unary":[117,175],"or":[118],"binary.":[119],"Like":[120],"al.,":[123],"rely":[125],"reduction":[128,191],"reachability":[131,171,206],"parameterized":[136],"tests":[137],"(OCA(P)).":[138],"The":[139],"new":[140],"aspect":[141],"simulate":[145],"OCA(P)":[146,173],"by":[147,192],"alternating":[148],"two-way":[149],"over":[151],"words.":[152],"This":[153],"implies":[154],"an":[155,167,198],"exponential":[156],"upper":[157],"bound":[158],"parameter":[161],"exploit":[165],"towards":[166],"NP":[168],"algorithm":[169],"updates.":[176],"obtain":[178],"our":[179],"main":[180],"result":[181],"as":[182],"corollary.":[184],"another":[186],"application,":[187],"relying":[188],"Bundala":[193],"Ouaknine,":[195],"obtains":[197],"alternative":[199],"proof":[200],"known":[203],"fact":[204],"closed":[208],"parametric":[209,214],"timed":[210],"clock":[215],"NEXPTIME.":[218]},"counts_by_year":[],"updated_date":"2026-04-20T07:46:08.049788","created_date":"2025-10-10T00:00:00"}