Correcting a Space-Efficient Simulation Algorithm

Select |




Print


van Glabbeek, Robert; Ploeger, Bas

van Glabbeek, Robert; Ploeger, Bas


2008-07-07


Conference Material


20th International Conference on Computer Aided Verification, CAV 2008


Princeton, USA


517-529


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.


Springer


Concurrency, verification, algorithms, time and space complexity, simulation preorder, Kripke structures, generalised coarsest partition problem.


http://www.cse.unsw.edu.au/~rvg/pub/simulation.pdf


0302-9743


nicta:156


van Glabbeek, Robert; Ploeger, Bas. Correcting a Space-Efficient Simulation Algorithm. In: A. Gupta & S. Malik Editor, editor/s. 20th International Conference on Computer Aided Verification, CAV 2008; Princeton, USA. Springer; 2008-07-07. 517-529.



Loading citation data...

Citation counts
(Requires subscription to view)