Divide and Compose: SCC Refinement for Language Emptiness

  • Chao Wang
  • Roderick Bloem
  • Gary D. Hachtel
  • Kavita Ravi
  • Fabio Somenzi
Conference paper

DOI: 10.1007/3-540-44685-0_31

Volume 2154 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Wang C., Bloem R., Hachtel G.D., Ravi K., Somenzi F. (2001) Divide and Compose: SCC Refinement for Language Emptiness. In: Larsen K.G., Nielsen M. (eds) CONCUR 2001 — Concurrency Theory. CONCUR 2001. Lecture Notes in Computer Science, vol 2154. Springer, Berlin, Heidelberg

Abstract

We propose a refinement approach to symbolic SCC analysis, which performs large parts of the computation on abstracted systems, and on small subsets of the state space. For language-emptiness checking, it quickly discards uninteresting parts of the state space; for the remaining states, it adapts the model checking computation to the strength of the SCCs at hand.

We present a general framework for SCC refinement, which uses a compositional approach to generate and refine overapproximations. We show that our algorithm significantly outperforms the one of Emerson and Lei.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Chao Wang
    • 1
  • Roderick Bloem
    • 1
  • Gary D. Hachtel
    • 1
  • Kavita Ravi
    • 2
  • Fabio Somenzi
    • 1
  1. 1.University of Colorado at BoulderUSA
  2. 2.Cadence Design SystemsUSA