{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:39:39Z","timestamp":1753889979932,"version":"3.41.2"},"reference-count":1,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2013,2,15]],"date-time":"2013-02-15T00:00:00Z","timestamp":1360886400000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>This paper presents a range of quantitative extensions for the temporal logic\nCTL. We enhance temporal modalities with the ability to constrain the number of\nstates satisfying certain sub-formulas along paths. By selecting the\ncombinations of Boolean and arithmetic operations allowed in constraints, one\nobtains several distinct logics generalizing CTL. We provide a thorough\nanalysis of their expressiveness and succinctness, and of the complexity of\ntheir model-checking and satisfiability problems (ranging from P-complete to\nundecidable). Finally, we present two alternative logics with similar features\nand provide a comparative study of the properties of both variants.<\/jats:p>","DOI":"10.2168\/lmcs-9(1:3)2013","type":"journal-article","created":{"date-parts":[[2013,11,29]],"date-time":"2013-11-29T13:36:16Z","timestamp":1385732176000},"source":"Crossref","is-referenced-by-count":1,"title":["Counting CTL"],"prefix":"10.46298","volume":"Volume 9, Issue 1","author":[{"given":"Fran\u00e7ois","family":"Laroussinie","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antoine","family":"Meyer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eudes","family":"Petonnet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"25203","published-online":{"date-parts":[[2013,2,15]]},"reference":[{"key":"721:not-found"}],"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/1058\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/1058\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,11]],"date-time":"2023-04-11T20:02:19Z","timestamp":1681243339000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/1058"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2,15]]},"references-count":1,"URL":"https:\/\/doi.org\/10.2168\/lmcs-9(1:3)2013","relation":{"is-same-as":[{"id-type":"arxiv","id":"1211.4651","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1211.4651","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2013,2,15]]},"article-number":"1058"}}