Computer Science – Logic in Computer Science
Scientific paper
2010-11-10
Computer Science
Logic in Computer Science
Scientific paper
This paper presents a novel technique for state space reduction of probabilistic specifications, based on a newly developed notion of confluence for probabilistic automata. We prove that this reduction preserves branching probabilistic bisimulation and can be applied on-the-fly. To support the technique, we introduce a method for detecting confluent transitions in the context of a probabilistic process algebra with data, facilitated by an earlier defined linear format. A case study demonstrates that significant reductions can be obtained.
de Pol Jaco van
Stoelinga Mariëlle
Timmer Mark
No associations
LandOfFree
Confluence Reduction for Probabilistic Systems (extended version) does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Confluence Reduction for Probabilistic Systems (extended version), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Confluence Reduction for Probabilistic Systems (extended version) will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-613697