Search

• < Previous
• 1
• Next >

Cost Preserving Bisimulations for Probabilistic Automata

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&nbsp;[&hellip;]