{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T03:13:31Z","timestamp":1767237211141,"version":"3.41.2"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2008,6,20]],"date-time":"2008-06-20T00:00:00Z","timestamp":1213920000000},"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>We consider the model of priced (a.k.a. weighted) timed automata, an\nextension of timed automata with cost information on both locations and\ntransitions, and we study various model-checking problems for that model based\non extensions of classical temporal logics with cost constraints on modalities.\nWe prove that, under the assumption that the model has only one clock,\nmodel-checking this class of models against the logic WCTL, CTL with\ncost-constrained modalities, is PSPACE-complete (while it has been shown\nundecidable as soon as the model has three clocks). We also prove that\nmodel-checking WMTL, LTL with cost-constrained modalities, is decidable only if\nthere is a single clock in the model and a single stopwatch cost variable\n(i.e., whose slopes lie in {0,1}).<\/jats:p>","DOI":"10.2168\/lmcs-4(2:9)2008","type":"journal-article","created":{"date-parts":[[2009,9,4]],"date-time":"2009-09-04T06:11:13Z","timestamp":1252044673000},"source":"Crossref","is-referenced-by-count":19,"title":["Model Checking One-clock Priced Timed Automata"],"prefix":"10.46298","volume":"Volume 4, Issue 2","author":[{"given":"Patricia","family":"Bouyer","sequence":"first","affiliation":[]},{"given":"Kim G.","family":"Larsen","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1977-7525","authenticated-orcid":false,"given":"Nicolas","family":"Markey","sequence":"additional","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2008,6,20]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/828\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/828\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,11]],"date-time":"2023-04-11T19:57:05Z","timestamp":1681243025000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/828"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,6,20]]},"references-count":0,"URL":"https:\/\/doi.org\/10.2168\/lmcs-4(2:9)2008","relation":{"is-same-as":[{"id-type":"arxiv","id":"0805.1457","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.0805.1457","asserted-by":"subject"}],"is-referenced-by":[{"id-type":"doi","id":"10.1007\/978-3-319-10575-8_29","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2008,6,20]]},"article-number":"828"}}