Adaptive Symmetry Reduction

  • Thomas Wahl
Conference paper

DOI: 10.1007/978-3-540-73368-3_43

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4590)
Cite this paper as:
Wahl T. (2007) Adaptive Symmetry Reduction. In: Damm W., Hermanns H. (eds) Computer Aided Verification. CAV 2007. Lecture Notes in Computer Science, vol 4590. Springer, Berlin, Heidelberg

Abstract

Symmetry reduction is a technique to counter state explosion for systems of regular structure. It relies on idealistic assumptions about indistinguishable components, which in practice may only be similar. In this paper we present a generalized algebraic approach to symmetry reduction for exploring a structure without any prior knowledge about its global symmetry. The more behavior is shared among the components, the more compression takes effect. Our idea is to annotate each encountered state with information about how symmetry is violated along the path leading to it. Previous solutions only allow specific types of asymmetry, such as up to bisimilarity, or seem to incur large overhead before or during the verification run. In contrast, our method appeals through its balance between generality and simplicity. We include analytic and experimental results to document its efficiency.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Thomas Wahl
    • 1
  1. 1.Department of Computer Sciences, The University of Texas at AustinUSA

Personalised recommendations