Cost Preserving Bisimulations for Probabilistic Automata
In Concurrency Theory - 24th International Conference (CONCUR)
, pages 349-363, Springer
, Lecture Notes in Computer Science 8052, 2013.
Downloads: pdf, bibURL: http://dx.doi.org/10.1007/978-3-642-40184-8_25
Abstract. Probabilistic automata constitute a versatile and elegant model for concurrent probabilistic systems. They are equipped with a compositional theory supporting abstraction, enabled by weak probabilistic bisimulation serving as the reference notion for summarising the effect of abstraction.
This paper considers probabilistic automata augmented with costs. It extends the notions of weak transitions in probabilistic automata in such a way that the costs incurred along a weak transition are captured. This gives rise to cost- preserving and cost-bounding variations of weak probabilistic bisimilarity. Polynomial-time decision algorithms are proposed, that can be effectively used to compute reward-bounding abstractions of Markov decision processes.