Distributed Branching Bisimulation Minimization by Inductive Signatures

Details Distributed Branching Bisimulation Minimization by Inductive Signatures Distributed Branching Bisimulation Minimization by Inductive Signatures

2009-12-13

arxiv.org/abs/0912.2550v1

EPTCS 14, 2009, pp. 32-46

Computer Science

Logic in Computer Science

Scientific paper

10.4204/EPTCS.14.3

We present a new distributed algorithm for state space minimization modulo branching bisimulation. Like its predecessor it uses signatures for refinement, but the refinement process and the signatures have been optimized to exploit the fact that the input graph contains no tau-loops. The optimization in the refinement process is meant to reduce both the number of iterations needed and the memory requirements. In the former case we cannot prove that there is an improvement, but our experiments show that in many cases the number of iterations is smaller. In the latter case, we can prove that the worst case memory use of the new algorithm is linear in the size of the state space, whereas the old algorithm has a quadratic upper bound. The paper includes a proof of correctness of the new algorithm and the results of a number of experiments that compare the performance of the old and the new algorithms.

Affiliated with

Also associated with

No associations

Rating

Distributed Branching Bisimulation Minimization by Inductive Signatures 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 Distributed Branching Bisimulation Minimization by Inductive Signatures, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Distributed Branching Bisimulation Minimization by Inductive Signatures will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-623922