{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:37:55Z","timestamp":1753889875442,"version":"3.41.2"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2020,6,23]],"date-time":"2020-06-23T00:00:00Z","timestamp":1592870400000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,6,23]],"date-time":"2020-06-23T00:00:00Z","timestamp":1592870400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,6,23]],"date-time":"2020-06-23T00:00:00Z","timestamp":1592870400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"accepted":{"date-parts":[[2025,4,1]]},"abstract":"<jats:p>This paper is a sequel of &amp;quot;Forward Analysis for WSTS, Part I: Completions&amp;quot; [STACS 2009, LZI Intl. Proc. in Informatics 3, 433-444] and &amp;quot;Forward Analysis for WSTS, Part II: Complete WSTS&amp;quot; [Logical Methods in Computer Science 8(3), 2012]. In these two papers, we provided a framework to conduct forward reachability analyses of WSTS, using finite representations of downward-closed sets. We further develop this framework to obtain a generic Karp-Miller algorithm for the new class of very-WSTS. This allows us to show that coverability sets of very-WSTS can be computed as their finite ideal decompositions. Under natural effectiveness assumptions, we also show that LTL model checking for very-WSTS is decidable. The termination of our procedure rests on a new notion of acceleration levels, which we study. We characterize those domains that allow for only finitely many accelerations, based on ordinal ranks.<\/jats:p>","DOI":"10.23638\/lmcs-16(2:13)2020","type":"journal-article","created":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T17:39:39Z","timestamp":1743701979000},"source":"Crossref","is-referenced-by-count":0,"title":["Forward Analysis for WSTS, Part III: Karp-Miller Trees"],"prefix":"10.23638","volume":"Volume 16, Issue 2","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2914-2734","authenticated-orcid":false,"given":"Michael","family":"Blondin","sequence":"first","affiliation":[]},{"given":"Alain","family":"Finkel","sequence":"additional","affiliation":[]},{"given":"Jean","family":"Goubault-Larrecq","sequence":"additional","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2020,6,23]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/arxiv.org\/pdf\/1710.07258v5","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/arxiv.org\/pdf\/1710.07258v5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T17:39:39Z","timestamp":1743701979000},"score":1,"resource":{"primary":{"URL":"http:\/\/lmcs.episciences.org\/4971"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,23]]},"references-count":0,"URL":"https:\/\/doi.org\/10.23638\/lmcs-16(2:13)2020","relation":{"has-preprint":[{"id-type":"arxiv","id":"1710.07258v4","asserted-by":"subject"},{"id-type":"arxiv","id":"1710.07258v3","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"1710.07258","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1710.07258","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2020,6,23]]},"article-number":"4971"}}