Local First Search — A New Paradigm for Partial Order Reductions

  • Peter Niebert
  • Michaela Huhn
  • Sarah Zennou
  • Denis Lugiez
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2154)


Partial order reductions are an approved heuristic method to cope with the state explosion problem, i.e; the combinatory explosion due to the interleaving representation of a parallel system. The partial order reductions work by providing sufficient criteria for building only a part of the full transition system on which the verification algorithms still compute the correct result for verifying local properties.

In this work, we present a new reduction method with a completely different justification and functioning: We show that under very realistic assumptions, local properties can be verified considering paths only corresponding to partial orders with very few maximal elements. Then we use this observation to derive our local first search algorithm. Our method can be understood as a hybrid between partial order reductions and the McMillan unfolding approach.

Experiments justify the practicality of the method.


Partial Order Model Check Transition System Maximal Element Partial Order Reduction 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [CG87]
    E.M. Clarke and O. Grumberg, Avoiding the state explosion problem in temporal logic model checking algorithms, Sixth Annual ACM Symposium on Principles of Distributed Computing, 1987, pp. 294–303.Google Scholar
  2. [DR95]
    V. Diekert and G. Rozenberg (eds.), The book of traces, World Scientific, 1995.Google Scholar
  3. [EH00]
    J. Esparza and K. Heljanko, A new unfolding approach to LTL model checking ICALP, LNCS, vol. 1835, 2000, pp. 475–486.Google Scholar
  4. [ERV96]
    J. Esparza, S. Römer, and W. Vogler, An improvement of McMillan’s unfolding algorithm, TAC AS (T. Margaria and B. Steffen, eds.), LNCS, vol. 1055, 1996, pp. 87–106.Google Scholar
  5. [Esp94]
    J. Esparza, Model checking using net unfoldings, Science of Computer Programming 23 (1994), 151–195.zbMATHCrossRefMathSciNetGoogle Scholar
  6. [FRV79]
    P. Flajolet, J.C. Raoult, and J. Vuillemin, The number of registers required for evaluating arithmetic expressions, Theoretical Computer Science 9 (1979), 99–125.zbMATHCrossRefMathSciNetGoogle Scholar
  7. [HNW98]
    M. Huhn, P. Niebert, and F. Wallner, Verification on local states, TACAS, LNCS, Springer-Verlag, 1998.Google Scholar
  8. [McM92]
    K.L. McMillan, Using unfoldings to avoid the state explosion problem in the verification of asynchronous circuits, Computer Aided Verification (CAV), 1992, pp. 164–174.Google Scholar
  9. [Pel93]
    D. Peled, All from one, one for all: On model checking using representatives, International Conference on Computer Aided Verification (CAV), LNCS, vol. 697, 1993, pp. 409–423.Google Scholar
  10. [Pen97]
    W. Penczek, Model checking for a subclass of event structures, TACAS (Ed. Brinksma, ed.), LNCS, 1997.Google Scholar
  11. [Str52]
    A.N. Strahler, Hypsometric (area-altitude) analysis of erosonal topology, Bull. Geol. Soc. of America 63 (1952), 1117–1142.CrossRefGoogle Scholar
  12. [Val89]
    A. Valmari, Stubborn sets for reduced state space generation, 10th International Conference on Application and Theory of Petri Nets, vol. 2, 1989, pp. 1–22.Google Scholar
  13. [Wal98]
    F. Wallner, Model checkin LTL using net unfoldings, CAV, LNCS, vol. 1427, 1998, pp. 207–218.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Peter Niebert
    • 1
  • Michaela Huhn
    • 2
  • Sarah Zennou
    • 1
  • Denis Lugiez
    • 1
  1. 1.Laboratoire d’Informatique de MarseilleUniversité de Provence - CMIMarseille Cedex 13
  2. 2.Institut für SoftwareTU BraunschweigBraunschweig

Personalised recommendations