Refinement Modal Logic

Details Refinement Modal Logic Refinement Modal Logic

2012-02-16

arxiv.org/abs/1202.3538v1

Computer Science

Logic in Computer Science

Scientific paper

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 'forall' in additional to the standard modalities 'Box' for each agent. The operator 'forall' acts as a quantifier over the set of all refinements of a given model. We call it the refinement operator. As a variation on a bisimulation quantifier, it can be seen as a refinement quantifier over a variable not occurring in the formula bound by the operator. The logic combines the simplicity of multi-agent modal logic with some powers of monadic second order quantification. We present a sound and complete axiomatization of multiagent refinement modal logic. We also present an extension of the logic to the modal mu-calculus, and an axiomatization for the single-agent version of this logic. Examples and applications are also discussed: to software verification and design (the set of agents can also be seen as a set of actions), and to dynamic epistemic logic. We further give detailed results on the complexity of satisfiability, and on succinctness.

Affiliated with

Also associated with

No associations

Rating

Refinement Modal Logic does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Refinement Modal Logic, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Refinement Modal Logic will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-125166