Skip to main content


Correcting a space-efficient simulation algorithm


Rob van Glabbeek and Bas Ploeger



Eindhoven University of Technology


Although there are many efficient algorithms for calculating the simulation preorder on finite Kripke structures, only two have been proposed of which the space complexity is of the same order as the size of the output of the algorithm. Of these, the one with the best time complexity exploits the representation of the simulation problem as a generalised coarsest partition problem. It is based on a fixed-point operator for obtaining a generalised coarsest partition as the limit of a sequence of partition pairs. We show that this fixed-point theory is flawed, and that the algorithm is incorrect. Although we do not see how the fixed-point operator can be repaired, we correct the algorithm without affecting its space and time complexity.

BibTeX Entry

    publisher        = {Springer},
    author           = {van Glabbeek, Robert and Ploeger, Bas},
    issn             = {0302-9743},
    month            = jul,
    editor           = {{A. Gupta \& S. Malik}},
    year             = {2008},
    keywords         = {concurrency, verification, algorithms, time and space complexity, simulation preorder, kripke
                        structures, generalised coarsest partition problem.},
    title            = {Correcting a Space-Efficient Simulation Algorithm},
    booktitle        = {20th International Conference on Computer Aided Verification, CAV 2008},
    pages            = {517-529},
    address          = {Princeton, USA}


Served by Apache on Linux on seL4.