Bisimulation in model-changing modal logics: An algorithmic study

Ghosh, S and Gupta, S and Li, L (2024) Bisimulation in model-changing modal logics: An algorithmic study. In: Journal of Logic and Computation, 34 (2). pp. 399-427.

PDF jou_log_com_34_2_2024.pdf - Published Version Restricted to Registered users only Download (991kB)

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. © The Author(s) 2023. Published by Oxford University Press. All rights reserved.

Item Type:	Journal Article
Publication:	Journal of Logic and Computation
Publisher:	Oxford University Press
Additional Information:	The copyright for this article belongs to the Oxford University Press.
Keywords:	Algorithmic analysis; Algorithmics; Bisimulations; High complexity; Modal logic; Models comparisons; Upper Bound, Formal logic
Department/Centre:	Division of Electrical Sciences > Computer Science & Automation
Date Deposited:	23 Apr 2024 06:39
Last Modified:	23 Apr 2024 06:39
URI:	https://eprints.iisc.ac.in/id/eprint/84646

Actions (login required)

View Item