11 research outputs found
Scalable Minimization Algorithm for Partial Bisimulation
We present an efficient algorithm for computing the partial bisimulation
preorder and equivalence for labeled transitions systems. The partial
bisimulation preorder lies between simulation and bisimulation, as only a part
of the set of actions is bisimulated, whereas the rest of the actions are
simulated. Computing quotients for simulation equivalence is more expensive
than for bisimulation equivalence, as for simulation one has to account for the
so-called little brothers, which represent classes of states that can simulate
other classes. It is known that in the absence of little brother states,
(partial bi)simulation and bisimulation coincide, but still the complexity of
existing minimization algorithms for simulation and bisimulation does not
scale. Therefore, we developed a minimization algorithm and an accompanying
tool that scales with respect to the bisimulated action subset.Comment: In Proceedings WS-FMDS 2012, arXiv:1207.184
Correcting a space-efficient simulation algorithm
Abstract 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
Correcting a space-efficient simulation algorithm
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
Correcting a space-efficient simulation algorithm
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
Correcting a Space-Efficient Simulation Algorithm
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.