{"id":"https://openalex.org/W1768670565","doi":"https://doi.org/10.1007/s00236-016-0284-z","title":"The complexity of counting models of linear-time temporal logic","display_name":"The complexity of counting models of linear-time temporal logic","publication_year":2016,"publication_date":"2016-11-17","ids":{"openalex":"https://openalex.org/W1768670565","doi":"https://doi.org/10.1007/s00236-016-0284-z","mag":"1768670565"},"language":"en","primary_location":{"id":"doi:10.1007/s00236-016-0284-z","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00236-016-0284-z","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/1408.5752","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5047901628","display_name":"Hazem Torfah","orcid":"https://orcid.org/0000-0002-9628-1200"},"institutions":[{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Hazem Torfah","raw_affiliation_strings":["Reactive Systems Group, Saarland University, 66123, Saarbr\u00fccken, Germany","saarland university"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Reactive Systems Group, Saarland University, 66123, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I91712215"]},{"raw_affiliation_string":"saarland university","institution_ids":["https://openalex.org/I91712215"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064596121","display_name":"Mart\u00edn Zimmermann","orcid":"https://orcid.org/0000-0002-8038-2453"},"institutions":[{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Martin Zimmermann","raw_affiliation_strings":["Reactive Systems Group, Saarland University, 66123, Saarbr\u00fccken, Germany","saarland university"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Reactive Systems Group, Saarland University, 66123, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I91712215"]},{"raw_affiliation_string":"saarland university","institution_ids":["https://openalex.org/I91712215"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5064596121"],"corresponding_institution_ids":["https://openalex.org/I91712215"],"apc_list":{"value":2990,"currency":"USD","value_usd":2990},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.00644946,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"55","issue":"3","first_page":"191","last_page":"212"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9993000030517578,"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.9993000030517578,"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/T11567","display_name":"semigroups and automata theory","score":0.9984999895095825,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9969000220298767,"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/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.7753560543060303},{"id":"https://openalex.org/keywords/time-hierarchy-theorem","display_name":"Time hierarchy theorem","score":0.7078942060470581},{"id":"https://openalex.org/keywords/unary-operation","display_name":"Unary operation","score":0.6448960900306702},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.625153660774231},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.6072658896446228},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5436320900917053},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.5207536220550537},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5060192942619324},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4746737480163574},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.47311851382255554},{"id":"https://openalex.org/keywords/counting-problem","display_name":"Counting problem","score":0.45742547512054443},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.44727569818496704},{"id":"https://openalex.org/keywords/nspace","display_name":"NSPACE","score":0.43994614481925964},{"id":"https://openalex.org/keywords/kolmogorov-complexity","display_name":"Kolmogorov complexity","score":0.4233686327934265},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3763972520828247},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.3309260606765747},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.31492558121681213},{"id":"https://openalex.org/keywords/universal-turing-machine","display_name":"Universal Turing machine","score":0.22889849543571472}],"concepts":[{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.7753560543060303},{"id":"https://openalex.org/C48415503","wikidata":"https://www.wikidata.org/wiki/Q5251122","display_name":"Time hierarchy theorem","level":5,"score":0.7078942060470581},{"id":"https://openalex.org/C78023250","wikidata":"https://www.wikidata.org/wiki/Q657596","display_name":"Unary operation","level":2,"score":0.6448960900306702},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.625153660774231},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.6072658896446228},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5436320900917053},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.5207536220550537},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5060192942619324},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4746737480163574},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47311851382255554},{"id":"https://openalex.org/C16592021","wikidata":"https://www.wikidata.org/wiki/Q5177154","display_name":"Counting problem","level":2,"score":0.45742547512054443},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.44727569818496704},{"id":"https://openalex.org/C201958364","wikidata":"https://www.wikidata.org/wiki/Q1756295","display_name":"NSPACE","level":5,"score":0.43994614481925964},{"id":"https://openalex.org/C2779341405","wikidata":"https://www.wikidata.org/wiki/Q1456811","display_name":"Kolmogorov complexity","level":2,"score":0.4233686327934265},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3763972520828247},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3309260606765747},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31492558121681213},{"id":"https://openalex.org/C131671149","wikidata":"https://www.wikidata.org/wiki/Q2703890","display_name":"Universal Turing machine","level":4,"score":0.22889849543571472},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.0}],"mesh":[],"locations_count":10,"locations":[{"id":"doi:10.1007/s00236-016-0284-z","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00236-016-0284-z","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:arXiv.org:1408.5752","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1408.5752","pdf_url":"https://arxiv.org/pdf/1408.5752","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"","raw_type":"text"},{"id":"mag:1768670565","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1408.5752","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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:CiteSeerX.psu:10.1.1.719.5300","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.719.5300","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://www.react.uni-saarland.de/publications/TZ14a.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.721.1033","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.721.1033","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://www.react.uni-saarland.de/publications/TZ14.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.758.1523","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.758.1523","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1408.5752.pdf","raw_type":"text"},{"id":"pmh:oai:drops-oai.dagstuhl.de:4846","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2014.241","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":"InProceedings"},{"id":"doi:10.48550/arxiv.1408.5752","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1408.5752","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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"},{"id":"doi:10.4230/lipics.fsttcs.2014.241","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.fsttcs.2014.241","pdf_url":null,"source":null,"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":"ConferencePaper"},{"id":"mag:3022736714","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/fsttcs/fsttcs2014.html#Torfah014","pdf_url":null,"source":{"id":"https://openalex.org/S4306418453","display_name":"Foundations of Software Technology and Theoretical Computer Science","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Foundations of Software Technology and Theoretical Computer Science","raw_type":null}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1408.5752","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1408.5752","pdf_url":"https://arxiv.org/pdf/1408.5752","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"","raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1230235592","display_name":null,"funder_award_id":"SFB/TR 14 AVACS","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G3200290721","display_name":null,"funder_award_id":"T-13-11","funder_id":"https://openalex.org/F4320321636","funder_display_name":"Deutsche Telekom Stiftung"},{"id":"https://openalex.org/G5949215475","display_name":null,"funder_award_id":"SFB/TR 14","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"},{"id":"https://openalex.org/F4320321636","display_name":"Deutsche Telekom Stiftung","ror":"https://ror.org/0550zmx90"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1483600339","https://openalex.org/W1527197079","https://openalex.org/W1583869287","https://openalex.org/W1984262532","https://openalex.org/W1993180032","https://openalex.org/W2003227046","https://openalex.org/W2006912660","https://openalex.org/W2013937118","https://openalex.org/W2023808162","https://openalex.org/W2033260394","https://openalex.org/W2049316103","https://openalex.org/W2061438988","https://openalex.org/W2131064738","https://openalex.org/W2204950161","https://openalex.org/W2949604038","https://openalex.org/W4241616303","https://openalex.org/W4298227433"],"related_works":["https://openalex.org/W2964114371","https://openalex.org/W2147305777","https://openalex.org/W2144557478","https://openalex.org/W2004815025","https://openalex.org/W2618462733","https://openalex.org/W1911876669","https://openalex.org/W2072909619","https://openalex.org/W1485836178","https://openalex.org/W2087065633","https://openalex.org/W2015895898","https://openalex.org/W2080097400","https://openalex.org/W159299097","https://openalex.org/W1723126856","https://openalex.org/W2059442203","https://openalex.org/W12087616","https://openalex.org/W1968529600","https://openalex.org/W2080886835","https://openalex.org/W2962798967","https://openalex.org/W2948686875","https://openalex.org/W2009317959"],"abstract_inverted_index":{"We":[0],"determine":[1],"the":[2,22,42,64,75,77,135,142],"complexity":[3],"of":[4,7,10,35,57,74,88,101,124,159],"counting":[5,32,54,85,98,108,121,149,156],"models":[6,151],"bounded":[8],"size":[9],"specifications":[11],"expressed":[12],"in":[13,26,46,68,139,146],"linear-time":[14],"temporal":[15],"logic.":[16],"Counting":[17,48],"word-models":[18],"is":[19,24,44,50,66,79,115,137,144,152],"#P-complete,":[20],"if":[21,41,63,134],"bound":[23,43,65,136,143],"given":[25,45,67,138,145],"unary,":[27],"and":[28,94,117],"as":[29,31,51,53,82,84,153,155],"hard":[30,52,83,154],"accepting":[33,55,86,99,122,157],"runs":[34,56,87,100,123,158],"nondeterministic":[36,58,89,102,125,160],"polynomial":[37,126],"space":[38,91],"Turing":[39,61,92,105,128,163],"machines,":[40,62,93],"binary.":[47],"tree-models":[49],"exponential":[59,90,161],"time":[60,104,127,162],"unary.":[69,140],"For":[70],"a":[71,113,131],"binary":[72],"encoding":[73],"bound,":[76],"problem":[78],"at":[80],"least":[81],"not":[95,118],"harder":[96,119],"than":[97,120],"doubly-exponential":[103],"machines.":[106,164],"Finally,":[107],"arbitrary":[109,150],"transition":[110],"systems":[111],"satisfying":[112],"formula":[114],"#P-hard":[116],"machines":[129],"with":[130],"PSPACE":[132],"oracle,":[133],"If":[141],"binary,":[147],"then":[148]},"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}