A distributed algorithm for strong bisimulation reduction of state spaces

29Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

Abstract

It is a known problem that state spaces can grow very big, which makes operating with them (including reducing them) difficult because of memory shortage. In the attempt to extend the size of the state spaces that can be dealt with, we designed and implemented a bisimulation reduction algorithm for distributed memory settings using message passing communication. By using message passing, the same implementation can be used on both large SMP machines and clusters of workstations. The algorithm performs reduction of large labeled transition systems modulo strong bisimulation. We justify its correctness and termination. We provide an evaluation of the worst-case time and message complexity and some performance data from a prototype implementation. Both theory and practice show that the algorithm scales up with the number of workers. © 2002 Published by Elsevier Science B.V.

Cite

CITATION STYLE

APA

Blom, S., & Orzan, S. (2005). A distributed algorithm for strong bisimulation reduction of state spaces. International Journal on Software Tools for Technology Transfer, 7(1), 74–86. https://doi.org/10.1007/s10009-004-0159-4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free