{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:35:59Z","timestamp":1753889759236,"version":"3.41.2"},"reference-count":1,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2013,11,12]],"date-time":"2013-11-12T00:00:00Z","timestamp":1384214400000},"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 priced timed Petri nets, i.e., unbounded Petri nets where each\ntoken carries a real-valued clock. Transition arcs are labeled with time\nintervals, which specify constraints on the ages of tokens. Furthermore, our\ncost model assigns token storage costs per time unit to places, and firing\ncosts to transitions. This general model strictly subsumes both priced timed\nautomata and unbounded priced Petri nets. We study the cost of computations\nthat reach a given control-state. In general, a computation with minimal cost\nmay not exist, due to strict inequalities in the time constraints. However, we\nshow that the infimum of the costs to reach a given control-state is computable\nin the case where all place and transition costs are non-negative. On the other\nhand, if negative costs are allowed, then the question whether a given\ncontrol-state is reachable with zero overall cost becomes undecidable. In fact,\nthis negative result holds even in the simpler case of discrete time (i.e.,\ninteger-valued clocks).<\/jats:p>","DOI":"10.2168\/lmcs-9(4:10)2013","type":"journal-article","created":{"date-parts":[[2014,7,15]],"date-time":"2014-07-15T09:37:51Z","timestamp":1405417071000},"source":"Crossref","is-referenced-by-count":5,"title":["Priced Timed Petri Nets"],"prefix":"10.46298","volume":"Volume 9, Issue 4","author":[{"given":"Richard M.","family":"Mayr","sequence":"first","affiliation":[]},{"given":"Parosh Aziz","family":"Abdulla","sequence":"additional","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2013,11,12]]},"reference":[{"key":"765:not-found"}],"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/874\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/874\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,11]],"date-time":"2023-04-11T19:58:16Z","timestamp":1681243096000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/874"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11,12]]},"references-count":1,"URL":"https:\/\/doi.org\/10.2168\/lmcs-9(4:10)2013","relation":{"is-same-as":[{"id-type":"arxiv","id":"1307.2570","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1307.2570","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2013,11,12]]},"article-number":"874"}}