A Database Approach to Distributed State-Space Generation

Stefan Blom, Bert Lisser, Jan Cornelis van de Pol, M. Weber, I. Cerna, Boudewijn R.H.M. Haverkort (Editor)

Research output: Contribution to journalArticleScientificpeer-review

Abstract

We study distributed state-space generation on a cluster of workstations. It is explained why state-space partitioning by a global hash function is problematic when states contain variables from unbounded domains, such as lists or other recursive data types. Our solution is to introduce a database which maintains a global numbering of state values. We also describe tree compression, a technique of recursive state folding, and show that it is superior to manipulating plain state vectors. This solution is implemented and linked to the muCRL toolset, where state values are implemented as maximally shared terms (ATerms). However, it is applicable to other models as well, e.g. PROMELA or LOTOS models. Our experiments show the trade-offs between keeping the database global, replicated or local, depending on the available network bandwidth and latency.
Original languageEnglish
Pages (from-to)45-62
Number of pages18
JournalJournal for Logic and Computation
VolumeAdvance Ac
Issue number1
DOIs
Publication statusPublished - 5 Mar 2009
Externally publishedYes

Fingerprint

State Space
Hash functions
Specification languages
Hash Function
Unbounded Domain
Folding
Bandwidth
Latency
Partitioning
Compression
Trade-offs
Experiments
Term
Model
Experiment
Data Base

Keywords

  • parallel algorithms
  • latency hiding
  • EC Grant Agreement nr.: FP6/043235
  • EWI-15980
  • Distributed model checking
  • FMT-MC: MODEL CHECKING
  • METIS-263982
  • IR-67856
  • CR-I.1.2

Cite this

Blom, Stefan ; Lisser, Bert ; van de Pol, Jan Cornelis ; Weber, M. ; Cerna, I. ; Haverkort, Boudewijn R.H.M. (Editor). / A Database Approach to Distributed State-Space Generation. In: Journal for Logic and Computation. 2009 ; Vol. Advance Ac, No. 1. pp. 45-62.
@article{badfe842d23e48efb86fee229e62c395,
title = "A Database Approach to Distributed State-Space Generation",
abstract = "We study distributed state-space generation on a cluster of workstations. It is explained why state-space partitioning by a global hash function is problematic when states contain variables from unbounded domains, such as lists or other recursive data types. Our solution is to introduce a database which maintains a global numbering of state values. We also describe tree compression, a technique of recursive state folding, and show that it is superior to manipulating plain state vectors. This solution is implemented and linked to the muCRL toolset, where state values are implemented as maximally shared terms (ATerms). However, it is applicable to other models as well, e.g. PROMELA or LOTOS models. Our experiments show the trade-offs between keeping the database global, replicated or local, depending on the available network bandwidth and latency.",
keywords = "parallel algorithms, latency hiding, EC Grant Agreement nr.: FP6/043235, EWI-15980, Distributed model checking, FMT-MC: MODEL CHECKING, METIS-263982, IR-67856, CR-I.1.2",
author = "Stefan Blom and Bert Lisser and {van de Pol}, {Jan Cornelis} and M. Weber and I. Cerna and Haverkort, {Boudewijn R.H.M.}",
note = "Advance Access since February 2009 M1 - 10.1093/logcom/exp004",
year = "2009",
month = "3",
day = "5",
doi = "10.1093/logcom/exp004",
language = "English",
volume = "Advance Ac",
pages = "45--62",
journal = "Journal for Logic and Computation",
issn = "0955-792X",
publisher = "Oxford University Press",
number = "1",

}

Blom, S, Lisser, B, van de Pol, JC, Weber, M, Cerna, I & Haverkort, BRHM (ed.) 2009, 'A Database Approach to Distributed State-Space Generation', Journal for Logic and Computation, vol. Advance Ac, no. 1, pp. 45-62. https://doi.org/10.1093/logcom/exp004

A Database Approach to Distributed State-Space Generation. / Blom, Stefan; Lisser, Bert; van de Pol, Jan Cornelis; Weber, M.; Cerna, I.; Haverkort, Boudewijn R.H.M. (Editor).

In: Journal for Logic and Computation, Vol. Advance Ac, No. 1, 05.03.2009, p. 45-62.

Research output: Contribution to journalArticleScientificpeer-review

TY - JOUR

T1 - A Database Approach to Distributed State-Space Generation

AU - Blom, Stefan

AU - Lisser, Bert

AU - van de Pol, Jan Cornelis

AU - Weber, M.

AU - Cerna, I.

A2 - Haverkort, Boudewijn R.H.M.

N1 - Advance Access since February 2009 M1 - 10.1093/logcom/exp004

PY - 2009/3/5

Y1 - 2009/3/5

N2 - We study distributed state-space generation on a cluster of workstations. It is explained why state-space partitioning by a global hash function is problematic when states contain variables from unbounded domains, such as lists or other recursive data types. Our solution is to introduce a database which maintains a global numbering of state values. We also describe tree compression, a technique of recursive state folding, and show that it is superior to manipulating plain state vectors. This solution is implemented and linked to the muCRL toolset, where state values are implemented as maximally shared terms (ATerms). However, it is applicable to other models as well, e.g. PROMELA or LOTOS models. Our experiments show the trade-offs between keeping the database global, replicated or local, depending on the available network bandwidth and latency.

AB - We study distributed state-space generation on a cluster of workstations. It is explained why state-space partitioning by a global hash function is problematic when states contain variables from unbounded domains, such as lists or other recursive data types. Our solution is to introduce a database which maintains a global numbering of state values. We also describe tree compression, a technique of recursive state folding, and show that it is superior to manipulating plain state vectors. This solution is implemented and linked to the muCRL toolset, where state values are implemented as maximally shared terms (ATerms). However, it is applicable to other models as well, e.g. PROMELA or LOTOS models. Our experiments show the trade-offs between keeping the database global, replicated or local, depending on the available network bandwidth and latency.

KW - parallel algorithms

KW - latency hiding

KW - EC Grant Agreement nr.: FP6/043235

KW - EWI-15980

KW - Distributed model checking

KW - FMT-MC: MODEL CHECKING

KW - METIS-263982

KW - IR-67856

KW - CR-I.1.2

U2 - 10.1093/logcom/exp004

DO - 10.1093/logcom/exp004

M3 - Article

VL - Advance Ac

SP - 45

EP - 62

JO - Journal for Logic and Computation

JF - Journal for Logic and Computation

SN - 0955-792X

IS - 1

ER -