Covariant-Contravariant Refinement Modal μ-calculus

  title={Covariant-Contravariant Refinement Modal $\mu$-calculus},
  author={Huili Xing},
  • Huili Xing
  • Published 5 August 2022
  • Computer Science
  • ArXiv
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… 

Figures from this paper



Logics for Contravariant Simulations

Covariant-contravariant simulation and conformance simulation are two generalizations of the simple notion of simulation which aim at capturing the fact that it is not always the case that “the

An axiomatization of bisimulation quantifiers via the mu-calculus

Equational Characterization of Covariant-Contravariant Simulation and Conformance Simulation Semantics

The axiomatizations of the preorders defined by the new simulation relations and their induced equivalences are presented and it is expected that by studying these examples they will be able to develop a general theory separating axiom atizable and non-axiomatizable semantics.

Relating Modal Refinements, Covariant-Contravariant Simulations and Partial Bisimulations

It is shown that there are mutual translations between modal transition systems and labelled transition systems that preserve, and reflect, refinement and the covariant-contravariant simulation preorder.

Proof systems for the coalgebraic cover modality

This work investigates an alternative presentation of classical and pos- itive modal logic where the coalgebraic cover modality is taken as primitive and presents a sound and complete Hilbert-styl e axiomatiza- tion for each logic.

Automata for the Modal mu-Calculus and related Results

It is shown that every formula is semantically equivalent to a disjunctive formula and this kind of formula gives rise to a new notion of finite automaton which characterizes the expressive power of the Μ-calculus over all transition systems.

Future Event Logic - Axioms and Complexity

This paper presents a sound and complete axiomatization of future event logic, a logic that generalizes a number of dynamic epistemic logics, by using a new operator that acts as a quantifier over the set of all refinements of a given model.

Non-strongly Stable Orders Also Define Interesting Simulation Relations

This study is motivated by some interesting classes of simulations that illustrate the application of the notion of coalgebraic simulation: covariant-contravariant simulations and conformance simulations.

Completeness of Kozen's Axiomatisation of the Propositional µ-Calculus

It is shown that this axiomatisation of the propositional μ-calculus is complete and therefore the model system K is complete.

Refinement modal logic