Local Model-Checking of an Alternation-Free Value-Based Modal Mu-Calculus

Programs written in value-passing description languages such as Crl and Lotos can be naturally translated into Labelled Transition Systems (Ltss) containing data values. In order to express temporal properties interpreted over these Ltss, we deene a value-based alternation-free modal-calculus built from typed variables, pattern-matching modalities, and parameterised xed point operators. The verii-cation of a temporal formula over a ((nite) Lts is reduced to the (partial) resolution of a Parameterised Boolean Equation System (Pbes). We propose a resolution method for Pbess that leads to a local model-checking algorithm, which could also be applied in the framework of abstract interpretation.