{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:39:31Z","timestamp":1753889971491,"version":"3.41.2"},"reference-count":1,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2014,12,18]],"date-time":"2014-12-18T00:00:00Z","timestamp":1418860800000},"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>Probabilistic automata constitute a versatile and elegant model for\nconcurrent probabilistic systems. They are equipped with a compositional theory\nsupporting abstraction, enabled by weak probabilistic bisimulation serving as\nthe reference notion for summarising the effect of abstraction. This paper\nconsiders probabilistic automata augmented with costs. It extends the notions\nof weak transitions in probabilistic automata in such a way that the costs\nincurred along a weak transition are captured. This gives rise to\ncost-preserving and cost-bounding variations of weak probabilistic\nbisimilarity, for which we establish compositionality properties with respect\nto parallel composition. Furthermore, polynomial-time decision algorithms are\nproposed, that can be effectively used to compute reward-bounding abstractions\nof Markov decision processes in a compositional manner.<\/jats:p>","DOI":"10.2168\/lmcs-10(4:11)2014","type":"journal-article","created":{"date-parts":[[2015,5,18]],"date-time":"2015-05-18T07:32:47Z","timestamp":1431934367000},"source":"Crossref","is-referenced-by-count":2,"title":["Cost Preserving Bisimulations for Probabilistic Automata"],"prefix":"10.46298","volume":"Volume 10, Issue 4","author":[{"given":"Andrea","family":"Turrini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Holger","family":"Hermanns","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"25203","published-online":{"date-parts":[[2014,12,18]]},"reference":[{"key":"990:not-found"}],"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/1050\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/1050\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,11]],"date-time":"2023-04-11T20:02:09Z","timestamp":1681243329000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/1050"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12,18]]},"references-count":1,"URL":"https:\/\/doi.org\/10.2168\/lmcs-10(4:11)2014","relation":{"is-same-as":[{"id-type":"arxiv","id":"1410.8314","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1410.8314","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2014,12,18]]},"article-number":"1050"}}