Bisimulation in model-changing modal logics: An algorithmic study

Abstract

Abstract We discuss the notion of bisimulation in various model-changing modal logics and provide an algorithmic study of the same. We provide a general algorithm which gives an overall procedure to check whether two models are bisimilar in all these logics. Through our algorithmic analyses we provide a PSPACE upper bound of the bisimulation/model comparison problem of all these modal logics. We also provide some insight into the higher complexity of the model comparison problem for these logics compared to that for the basic modal logic.