Andrea Turrini ; Holger Hermanns - Cost Preserving Bisimulations for Probabilistic Automata

lmcs:1050 - Logical Methods in Computer Science, December 18, 2014, Volume 10, Issue 4 -
Cost Preserving Bisimulations for Probabilistic Automata

Authors: Andrea Turrini ; Holger Hermanns

    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, for which we establish compositionality properties with respect to parallel composition. Furthermore, polynomial-time decision algorithms are proposed, that can be effectively used to compute reward-bounding abstractions of Markov decision processes in a compositional manner.

    Volume: Volume 10, Issue 4
    Published on: December 18, 2014
    Accepted on: June 25, 2015
    Submitted on: March 10, 2014
    Keywords: Computer Science - Formal Languages and Automata Theory,Computer Science - Logic in Computer Science

    2 Documents citing this article


    Consultation statistics

    This page has been seen 469 times.
    This article's PDF has been downloaded 294 times.