Covariant-Contravariant Refinement Modal $\mu$-calculus
Logic in Computer Science
2022-08-08 v1 Computation and Language
Formal Languages and Automata Theory
Abstract
The notion of covariant-contravariant refinement (CC-refinement, for short) is a generalization of the notions of bisimulation, simulation and refinement. This paper introduces CC-refinement modal -calculus (CCRML) obtained from the modal -calculus system K by adding CC-refinement quantifiers, establishes an axiom system for CCRML and explores the important properties: soundness, completeness and decidability of this axiom system. The language of CCRML may be considered as a specification language for describing the properties of a system referring to reactive and generative actions. It may be used to formalize some interesting problems in the field of formal methods.
Keywords
Cite
@article{arxiv.2208.02989,
title = {Covariant-Contravariant Refinement Modal $\mu$-calculus},
author = {Huili Xing},
journal= {arXiv preprint arXiv:2208.02989},
year = {2022}
}