Refinement Modal Logic

@article{Bozzelli2014RefinementML,
  title={Refinement Modal Logic},
  author={Laura Bozzelli and Hans van Ditmarsch and Tim French and James Hales and Sophie Pinchinat},
  journal={Inf. Comput.},
  year={2014},
  volume={239},
  pages={303-339}
}
In this paper we present refinement modal logic. A refinement is like a bisimulation, except that from the three relational requirements only 'atoms' and 'back' need to be satisfied. Our logic contains a new operator ? in addition to the standard box modalities for each agent. The operator ? acts as a quantifier over the set of all refinements of a given model. As a variation on a bisimulation quantifier, this refinement operator or refinement quantifier ? can be seen as quantifying over a… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 62 REFERENCES