Covariant-Contravariant Refinement Modal μ-calculus

08/05/2022
by   Huili Xing, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/23/2017

The Refinement Calculus of Reactive Systems Toolset

We present the Refinement Calculus of Reactive Systems Toolset, an envir...
research
07/12/2022

Mechanizing Refinement Types (extended)

Practical checkers based on refinement types use the combination of impl...
research
10/14/2021

First-Order Modal ξ-Calculus

This paper proposes first-order modal ξ-calculus as well as genealogical...
research
03/06/2013

Reasoning about the Value of Decision-Model Refinement: Methods and Application

We investigate the value of extending the completeness of a decision mod...
research
10/11/2017

The Refinement Calculus of Reactive Systems

The Refinement Calculus of Reactive Systems (RCRS) is a compositional fo...
research
06/08/2018

Formal Small-step Verification of a Call-by-value Lambda Calculus Machine

We formally verify an abstract machine for a call-by-value lambda-calcul...
research
04/04/2023

A Complete V-Equational System for Graded lambda-Calculus

Modern programming frequently requires generalised notions of program eq...

Please sign up or login with your details

Forgot password? Click here to reset