On the definability of simulation and bisimulation in epistemic logic

We explore when finite epistemic models are definable up to simulation or bisimulation, either over the basic multi-agent epistemic language L or over its extension L-C with common knowledge operators. Our main results are the following: (1) Bisimulation to finite epistemic states (i.e. pointed models) is not definable in L. (2) Global bisimulation to finite epistemic models is definable using model validity in L. (3) Simulation by finite epistemic states is not always definable, even over L-C. (4) We identify a class of epistemic models called well-multifounded for which simulation to finite epistemic states is definable over L. The first two results contrasts with that of van Benthem that finite epistemic states are definable up to bisimulation in L-C by so-called characteristic formulae. Our results have applications in the logical specification of multi-agent systems. Characteristic formulae, which define states up to bisimulation, fully capture all modally definable properties of models, and can for example be used to give complete calculi for validity over fixed structures. Meanwhile, simulation is a 'substructure' relation that is appropriate for epistemic logic, as it preserves positive existential formulae. Simulation formulae are useful in giving a dynamic description of models subject to epistemic actions