A Modal Logic for μCRL

Abstract

The language μCRL allows to specify processes with data and to reason with them in an algebraic vein. This allows to express and reason about global correctness of systems. Sometimes,one only needs to analyse particular properties of μCRL-processes. Modal logics are very convenient to express and verify such properties. Therefore, we define a modal logic for μCRL. It is a branching time modal logic based on actions. It has future and past operators and it allows for reasoning about data, for instance using first order quantification over data variables. It is shown that these modal formulae cannot distinguish between divergence sensitive branching bisimilar processes.