On Reduction Criteria for Probabilistic Reward Models

In recent papers, the partial order reduction approach has been adapted to reason about the probabilities for temporal properties in concurrent systems with probabilistic behaviours. This paper extends these results by presenting reduction criteria for a probabilistic branching time logic that allows specification of constraints on quantitative measures given by a reward or cost function for the actions of the system.

• Type: Conference
• Year: 2006
• Where: FSTTCS
• Authors: Marcus Größer, Gethin Norman, Christel Baier, Frank Ciesinski, Marta Z. Kwiatkowska, David Parker
• Keywords: FSTTCS 2006, Partial Order Reduction, Probabilistic Behaviours, Probabilistic Branching Time, Software Engineering