EEMCS

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

EEMCS EPrints Service


27828 Multi-core Symbolic Bisimulation Minimisation
Home Policy Brochure Browse Search User Area Contact Help

van Dijk, T. and van de Pol, J.C. (2016) Multi-core Symbolic Bisimulation Minimisation. In: Proceedings of the 22nd International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2016), 2-8 April 2016, Eindhoven, The Netherlands. pp. 332-348. Lecture Notes in Computer Science 9636. Springer Verlag. ISSN 0302-9743 ISBN 978-3-662-49673-2

Full text available as:

PDF (Editor's version)

372 Kb
PDF (Author's version)

498 Kb
Open Access



Official URL: http://dx.doi.org/10.1007/978-3-662-49674-9_19

Abstract

Bisimulation minimisation alleviates the exponential growth of transition systems in model checking by computing the smallest system that has the same behavior as the original system according to some notion of equivalence. One popular strategy to compute a bisimulation minimisation is signature-based partition refinement. This can be performed symbolically using binary decision diagrams to allow models with larger state spaces to be minimised.
This paper studies strong and branching symbolic bisimulation for labeled transition systems, continuous-time markov chains, and interactive markov chains. We introduce the notion of partition refinement with partial signatures. We extend the parallel BDD library Sylvan to parallelize the signature refinement algorithm, and develop a new parallel BDD algorithm to refine a partition, which conserves previous block numbers and uses a parallel data structure to store block assignments. We also present a specialized BDD algorithm for the computation of inert transitions. The experimental evaluation, based on benchmarks from the literature, demonstrates a speedup of up to 95x sequentially. In addition, we find parallel speedups of up to 17x due to parallelisation with 48 cores. Finally, we present the implementation of these algorithms as a versatile tool that can be customized for bisimulation minimisation in various contexts.

Item Type:Conference or Workshop Paper (Full Paper, Talk)
Research Group:EWI-FMT: Formal Methods and Tools
Research Program:CTIT-General
Research Project:MADRID: Multi Core Decision Diagrams
Uncontrolled Keywords:Multi-core, Parallel, Binary decision diagrams, Bisimulation minimisation, Labeled transition systems, Continuous-time Markov chains, Interactive Markov chains
ID Code:27828
Status:Published
Deposited On:20 April 2017
Refereed:Yes
International:Yes
More Information:statistics

Export this item as:

To correct this item please ask your editor

Repository Staff Only: edit this item