{"id":"https://openalex.org/W3037249291","doi":"https://doi.org/10.2168/lmcs-9(1:3)2013","title":"Counting CTL","display_name":"Counting CTL","publication_year":2013,"publication_date":"2013-02-15","ids":{"openalex":"https://openalex.org/W3037249291","doi":"https://doi.org/10.2168/lmcs-9(1:3)2013","mag":"3037249291"},"language":"en","primary_location":{"id":"doi:10.2168/lmcs-9(1:3)2013","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-9(1:3)2013","pdf_url":"https://lmcs.episciences.org/1058/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/1058/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5073507370","display_name":"Fran\u00e7ois Laroussinie","orcid":null},"institutions":[{"id":"https://openalex.org/I169173203","display_name":"D\u00e9l\u00e9gation Paris 7","ror":"https://ror.org/00bw5n526","country_code":"FR","type":"government","lineage":["https://openalex.org/I154526488","https://openalex.org/I169173203"]},{"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":"Fran\u00e7ois Laroussinie","raw_affiliation_strings":["LIAFA, Universit Paris Diderot -Paris","LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications (Universit\u00e9 Paris Diderot, B\u00e2t. Sophie Germain, case postale 7014, 75205 Paris cedex 13 - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LIAFA, Universit Paris Diderot -Paris","institution_ids":["https://openalex.org/I204730241","https://openalex.org/I4210094115","https://openalex.org/I169173203"]},{"raw_affiliation_string":"LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications (Universit\u00e9 Paris Diderot, B\u00e2t. Sophie Germain, case postale 7014, 75205 Paris cedex 13 - France)","institution_ids":["https://openalex.org/I204730241","https://openalex.org/I4210094115"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5032265613","display_name":"Antoine Meyer","orcid":"https://orcid.org/0000-0003-4513-4347"},"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/I2800365227","display_name":"Paris-Est Sup","ror":"https://ror.org/0268ecp52","country_code":"FR","type":"education","lineage":["https://openalex.org/I2800365227"]},{"id":"https://openalex.org/I4210152518","display_name":"Laboratoire d'Informatique Gaspard-Monge","ror":"https://ror.org/04t50yk91","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I142631665","https://openalex.org/I4210145102","https://openalex.org/I4210152518","https://openalex.org/I4210154111","https://openalex.org/I4210159245"]},{"id":"https://openalex.org/I4210154111","display_name":"Universit\u00e9 Gustave Eiffel","ror":"https://ror.org/03x42jk29","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210154111"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Antoine Meyer","raw_affiliation_strings":["LIGM, Universit Paris Est -Marne-la-Valle & CNRS UMR 8049, France","LIGM - Laboratoire d'Informatique Gaspard-Monge (Universit\u00e9 de Paris-Est Marne-la-Vall\u00e9e, Cit\u00e9 Descartes, B\u00e2timent Copernic, 5 bd Descartes, 77454 Marne-la-Vall\u00e9e Cedex 2 - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LIGM, Universit Paris Est -Marne-la-Valle & CNRS UMR 8049, France","institution_ids":["https://openalex.org/I4210152518","https://openalex.org/I2800365227","https://openalex.org/I1294671590"]},{"raw_affiliation_string":"LIGM - Laboratoire d'Informatique Gaspard-Monge (Universit\u00e9 de Paris-Est Marne-la-Vall\u00e9e, Cit\u00e9 Descartes, B\u00e2timent Copernic, 5 bd Descartes, 77454 Marne-la-Vall\u00e9e Cedex 2 - France)","institution_ids":["https://openalex.org/I4210152518","https://openalex.org/I4210154111"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089145643","display_name":"Eudes Petonnet","orcid":null},"institutions":[{"id":"https://openalex.org/I169173203","display_name":"D\u00e9l\u00e9gation Paris 7","ror":"https://ror.org/00bw5n526","country_code":"FR","type":"government","lineage":["https://openalex.org/I154526488","https://openalex.org/I169173203"]},{"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":false,"raw_author_name":"Eudes Petonnet","raw_affiliation_strings":["LIAFA, Universit Paris Diderot -Paris","LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications (Universit\u00e9 Paris Diderot, B\u00e2t. Sophie Germain, case postale 7014, 75205 Paris cedex 13 - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LIAFA, Universit Paris Diderot -Paris","institution_ids":["https://openalex.org/I204730241","https://openalex.org/I4210094115","https://openalex.org/I169173203"]},{"raw_affiliation_string":"LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications (Universit\u00e9 Paris Diderot, B\u00e2t. Sophie Germain, case postale 7014, 75205 Paris cedex 13 - France)","institution_ids":["https://openalex.org/I204730241","https://openalex.org/I4210094115"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5073507370"],"corresponding_institution_ids":["https://openalex.org/I169173203","https://openalex.org/I204730241","https://openalex.org/I4210094115"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.32821211,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"Volume 9, 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.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/T10126","display_name":"Logic, programming, and type systems","score":0.998199999332428,"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/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.996999979019165,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/succinctness","display_name":"Succinctness","score":0.8741466999053955},{"id":"https://openalex.org/keywords/undecidable-problem","display_name":"Undecidable problem","score":0.7895362377166748},{"id":"https://openalex.org/keywords/ctl*","display_name":"CTL*","score":0.7635352611541748},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.6614431738853455},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6550192832946777},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.6019025444984436},{"id":"https://openalex.org/keywords/temporal-logic","display_name":"Temporal logic","score":0.601144552230835},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.5295907855033875},{"id":"https://openalex.org/keywords/computation-tree-logic","display_name":"Computation tree logic","score":0.5267212390899658},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.513151228427887},{"id":"https://openalex.org/keywords/counterexample","display_name":"Counterexample","score":0.5096514225006104},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.5004312992095947},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3766520023345947},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.34524214267730713},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.29899048805236816},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2902817130088806}],"concepts":[{"id":"https://openalex.org/C2776493592","wikidata":"https://www.wikidata.org/wiki/Q5158717","display_name":"Succinctness","level":2,"score":0.8741466999053955},{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.7895362377166748},{"id":"https://openalex.org/C147969180","wikidata":"https://www.wikidata.org/wiki/Q5014579","display_name":"CTL*","level":4,"score":0.7635352611541748},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.6614431738853455},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6550192832946777},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.6019025444984436},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.601144552230835},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.5295907855033875},{"id":"https://openalex.org/C198008173","wikidata":"https://www.wikidata.org/wiki/Q1040040","display_name":"Computation tree logic","level":3,"score":0.5267212390899658},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.513151228427887},{"id":"https://openalex.org/C162838799","wikidata":"https://www.wikidata.org/wiki/Q596077","display_name":"Counterexample","level":2,"score":0.5096514225006104},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.5004312992095947},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3766520023345947},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34524214267730713},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.29899048805236816},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2902817130088806},{"id":"https://openalex.org/C202751555","wikidata":"https://www.wikidata.org/wiki/Q221681","display_name":"In vitro","level":2,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C154317977","wikidata":"https://www.wikidata.org/wiki/Q376266","display_name":"Cytotoxic T cell","level":3,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.2168/lmcs-9(1:3)2013","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-9(1:3)2013","pdf_url":"https://lmcs.episciences.org/1058/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:1211.4651","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1211.4651","pdf_url":"https://arxiv.org/pdf/1211.4651","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-00790010v1","is_oa":false,"landing_page_url":"https://hal.science/hal-00790010","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, 2013, 9 (1), pp.3.1-3.34. ⟨10.2168/LMCS-9(1:3)2013⟩","raw_type":"Journal articles"},{"id":"pmh:oai:doaj.org/article:b1a1e8c7e6e84d0fbfd95bfae521df7b","is_oa":true,"landing_page_url":"https://doaj.org/article/b1a1e8c7e6e84d0fbfd95bfae521df7b","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","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":"repository"},"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 9, Issue 1 (2013)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.2168/lmcs-9(1:3)2013","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-9(1:3)2013","pdf_url":"https://lmcs.episciences.org/1058/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":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3037249291.pdf","grobid_xml":"https://content.openalex.org/works/W3037249291.grobid-xml"},"referenced_works_count":20,"referenced_works":["https://openalex.org/W1489630028","https://openalex.org/W1512091132","https://openalex.org/W1590315663","https://openalex.org/W1593428110","https://openalex.org/W1981808971","https://openalex.org/W1988808695","https://openalex.org/W2023808162","https://openalex.org/W2030263557","https://openalex.org/W2051068608","https://openalex.org/W2058629773","https://openalex.org/W2059221592","https://openalex.org/W2067441543","https://openalex.org/W2106692345","https://openalex.org/W2138500680","https://openalex.org/W2139891885","https://openalex.org/W2175748456","https://openalex.org/W2293422809","https://openalex.org/W2396555304","https://openalex.org/W2806619258","https://openalex.org/W2911584291"],"related_works":["https://openalex.org/W858755136","https://openalex.org/W2140351986","https://openalex.org/W2143025323","https://openalex.org/W3005864166","https://openalex.org/W1981889059","https://openalex.org/W2398566420","https://openalex.org/W2572650333","https://openalex.org/W2104974242","https://openalex.org/W2563378524","https://openalex.org/W1965230791"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"a":[3,52,86],"range":[4],"of":[5,24,35,55,61,64,89,92],"quantitative":[6],"extensions":[7],"for":[8],"the":[9,18,22,33,62,90],"temporal":[10,15],"logic":[11],"CTL.":[12,49],"We":[13,50],"enhance":[14],"modalities":[16],"with":[17,81],"ability":[19],"to":[20,73],"constrain":[21],"number":[23],"states":[25],"satisfying":[26],"certain":[27],"sub-formulas":[28],"along":[29],"paths.":[30],"By":[31],"selecting":[32],"combinations":[34],"Boolean":[36],"and":[37,58,60,67,84],"arithmetic":[38],"operations":[39],"allowed":[40],"in":[41],"constraints,":[42],"one":[43],"obtains":[44],"several":[45],"distinct":[46],"logics":[47,80],"generalizing":[48],"provide":[51,85],"thorough":[53],"analysis":[54],"their":[56,65],"expressiveness":[57],"succinctness,":[59],"complexity":[63],"model-checking":[66],"satisfiability":[68],"problems":[69],"(ranging":[70],"from":[71],"P-complete":[72],"undecidable).":[74],"Finally,":[75],"we":[76],"present":[77],"two":[78],"alternative":[79],"similar":[82],"features":[83],"comparative":[87],"study":[88],"properties":[91],"both":[93],"variants.":[94]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2020-07-02T00:00:00"}