### Abstract

We prove a compactness theorem in the context of Hennessy–Milner logic and use it to derive a sufficient condition on modal characterisations for the approximation induction principle to be sound modulo the corresponding process equivalence. We show that this condition is necessary when the equivalence in question is compositional with respect to the projection operators. Furthermore, we derive different upper bounds for the constructive version of the approximation induction principle with respect to simulation and decorated trace semantics.

Original language | English |
---|---|

Pages (from-to) | 175-201 |

Journal | Mathematical Structures in Computer Science |

Volume | 22 |

Issue number | 2 |

DOIs | |

Publication status | Published - 2012 |

## Fingerprint Dive into the research topics of 'Modal logic and the approximation induction principle'. Together they form a unique fingerprint.

## Cite this

Gazda, M. W., & Fokkink, W. J. (2012). Modal logic and the approximation induction principle.

*Mathematical Structures in Computer Science*,*22*(2), 175-201. https://doi.org/10.1017/S0960129511000387