The Extension of Bisimulation Quantified Modal Logic Based on Covariant-Contravariant Refinement

The notion of covariant-contravariant refinement (CC-refinement, for short) is a generalization of the notions of bisimulation and refinement. This paper interprets semantically a CC-refinement as bisimulation plus model restriction, that is, a CC-refinement model of a given model may be obtained fr...

Full description

Bibliographic Details
Main Author: Huili Xing
Format: Article
Language:English
Published: IEEE 2019-01-01
Series:IEEE Access
Subjects:
Online Access:https://ieeexplore.ieee.org/document/8886458/
id doaj-d5e5022bfd62415490542b0dcaedc330
record_format Article
spelling doaj-d5e5022bfd62415490542b0dcaedc3302021-03-30T00:43:27ZengIEEEIEEE Access2169-35362019-01-01716024816026210.1109/ACCESS.2019.29502718886458The Extension of Bisimulation Quantified Modal Logic Based on Covariant-Contravariant RefinementHuili Xing0https://orcid.org/0000-0002-2783-8140Department of Medical Information, Binzhou Medical University, Yantai, ChinaThe notion of covariant-contravariant refinement (CC-refinement, for short) is a generalization of the notions of bisimulation and refinement. This paper interprets semantically a CC-refinement as bisimulation plus model restriction, that is, a CC-refinement model of a given model may be obtained from one bisimilar duplicate of this model by adding some transitions labelled by covariant actions and removing some transitions labelled by contravariant actions. By using certain proposition letter to witness a contravariant action, the standard bisimulation quantified modal logic is able to capture the characterization of this action, however, this fails for covariant actions. This paper, based on the notion of CC-refinement, introduces an extended bisimulation quantified modal logic with the universal modality (EBQML), describes syntactically CC-refinement quantification as the extended bisimulation quantification plus relativization, and establishes a translation from the language of CC-refinement modal μ-calculus to the language of EBQML such that every CC-refinement modal μ-formula is equivalent to its translation. The language of EBQML may be considered as a specification language for describing the properties of a system referring to reactive and generative actions, which are represented respectively by covariant and contravariant actions, and may be used to formalize some interesting problems in the field of formal methods.https://ieeexplore.ieee.org/document/8886458/Bisimulation quantificationmodal logiccovariant-contravariant refinement modal μ-calculusrelativization
collection DOAJ
language English
format Article
sources DOAJ
author Huili Xing
spellingShingle Huili Xing
The Extension of Bisimulation Quantified Modal Logic Based on Covariant-Contravariant Refinement
IEEE Access
Bisimulation quantification
modal logic
covariant-contravariant refinement modal μ-calculus
relativization
author_facet Huili Xing
author_sort Huili Xing
title The Extension of Bisimulation Quantified Modal Logic Based on Covariant-Contravariant Refinement
title_short The Extension of Bisimulation Quantified Modal Logic Based on Covariant-Contravariant Refinement
title_full The Extension of Bisimulation Quantified Modal Logic Based on Covariant-Contravariant Refinement
title_fullStr The Extension of Bisimulation Quantified Modal Logic Based on Covariant-Contravariant Refinement
title_full_unstemmed The Extension of Bisimulation Quantified Modal Logic Based on Covariant-Contravariant Refinement
title_sort extension of bisimulation quantified modal logic based on covariant-contravariant refinement
publisher IEEE
series IEEE Access
issn 2169-3536
publishDate 2019-01-01
description The notion of covariant-contravariant refinement (CC-refinement, for short) is a generalization of the notions of bisimulation and refinement. This paper interprets semantically a CC-refinement as bisimulation plus model restriction, that is, a CC-refinement model of a given model may be obtained from one bisimilar duplicate of this model by adding some transitions labelled by covariant actions and removing some transitions labelled by contravariant actions. By using certain proposition letter to witness a contravariant action, the standard bisimulation quantified modal logic is able to capture the characterization of this action, however, this fails for covariant actions. This paper, based on the notion of CC-refinement, introduces an extended bisimulation quantified modal logic with the universal modality (EBQML), describes syntactically CC-refinement quantification as the extended bisimulation quantification plus relativization, and establishes a translation from the language of CC-refinement modal μ-calculus to the language of EBQML such that every CC-refinement modal μ-formula is equivalent to its translation. The language of EBQML may be considered as a specification language for describing the properties of a system referring to reactive and generative actions, which are represented respectively by covariant and contravariant actions, and may be used to formalize some interesting problems in the field of formal methods.
topic Bisimulation quantification
modal logic
covariant-contravariant refinement modal μ-calculus
relativization
url https://ieeexplore.ieee.org/document/8886458/
work_keys_str_mv AT huilixing theextensionofbisimulationquantifiedmodallogicbasedoncovariantcontravariantrefinement
AT huilixing extensionofbisimulationquantifiedmodallogicbasedoncovariantcontravariantrefinement
_version_ 1724187961029820416