An Efficient Simulation Algorithm on Kripke Structures
Abstract
A number of algorithms for computing the simulation preorder (and equivalence) on Kripke structures are available. Let Sigma denote the state space, -> the transition relation and Psim the partition of Sigma induced by simulation equivalence. While some algorithms are designed to reach the best space bounds, whose dominating additive term is |Psim|^2, other algorithms are devised to attain the best time complexity O(|Psim||->|). We present a novel simulation algorithm which is both space and time efficient: it runs in O(|Psim|^2 log|Psim| + |Sigma|log|Sigma|) space and O(|Psim||->|log|Sigma|) time. Our simulation algorithm thus reaches the best space bounds while closely approaching the best time complexity.
Cite
@article{arxiv.1212.1089,
title = {An Efficient Simulation Algorithm on Kripke Structures},
author = {Francesco Ranzato},
journal= {arXiv preprint arXiv:1212.1089},
year = {2013}
}
Comments
Conference version appeared in Proceedings of the 38th International Symposium on Mathematical Foundations of Computer Science (MFCS'13)