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. © 2012 Cambridge University Press.
|Journal||Mathematical Structures in Computer Science (MSCS)|
|Publication status||Published - 2012|