EEMCS
Home > Publications
Home University of Twente
Education
Research
Prospective Students
Jobs
Publications
Intranet (internal)
 
 Nederlands
 Contact
 Sitemap
 Search
 Organisation

EEMCS EPrints Service


17088 Distributed Branching Bisimulation Minimization by Inductive Signatures
 Home Policy Brochure Browse Search User Area Contact Help

Blom, S.C.C. and van de Pol, J.C. (2009) Distributed Branching Bisimulation Minimization by Inductive Signatures. In: Proceedings 8th International Workshop on Parallel and Distributed Methods in verifiCation, 4 Nov 2009, Eindhoven, The Netherlands. pp. 32-46. Electronic Proceedings in Theoretical Computer Science 14. Open Publishing Association. ISSN 2075-2180

Full text available as:

PDF (Public electronic version)
 - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
249 Kb

Official URL: http://dx.doi.org/10.4204/EPTCS.14.3

Exported to Metis

Abstract

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.

Item Type:Conference or Workshop Paper (Full Paper, Talk)
Research Group:EWI-FMT: Formal Methods and Tools
Research Program:CTIT-DSN: Dependable Systems and Networks
Research Project:EC-MOAN: Scalable Modelling and Analysis Techniques to study Emergent Cell Behaviour – understanding the E. coli stress response
Uncontrolled Keywords:distributed reduction algorithm, branching bisimulation, minimization
ID Code:17088
Status:Published
Deposited On:13 January 2010
Refereed:Yes
International:Yes
More Information:statisticsmetis

Export this item as:

To correct this item please ask your editor

Repository Staff Only: edit this item