Refinement modal logic

@article{Bozzelli2012RefinementML,
  title={Refinement modal logic},
  author={Laura Bozzelli and Hans van Ditmarsch and Tim French and James Hales and Sophie Pinchinat},
  journal={Inf. Comput.},
  year={2012},
  volume={239},
  pages={303-339}
}

Figures from this paper

Algebraic semantics of refinement modal logic

Algebraic semantics of refinement modal logic is developed using duality theory and it is shown that refinement modAL logic is sound and complete with respect to the algebraic semantics introduced.

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

An extended bisimulation quantified modal logic with the universal modality ■ is introduced and 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.

Closing a Gap in the Complexity of Refinement Modal Logic

A tight characterization of the complexity of RML satisfiability for any fixed number of alternations of refinement quantifiers is obtained, and it is established that the model checking problem for RML is PSPACE-complete, even for formulas with a single quantifier.

Refinement Modal Logic Based on Finite Approximation of Covariant-Contravariant Refinement

An axiom system for <inline-formula> <tex-math notation="LaTeX">$n$ </tex-Math></inline- formula>CCRML is established, and some important properties of this axiomSystem are explored: soundness, completeness, and decidability.

Arbitrary Action Model Logic and Action Model Synthesis

  • James Hales
  • Computer Science
    2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
  • 2013
This work introduces an extension of the action model logic of Baltag, Moss and Solecki with an action model quantifier, ∃φ which stands for “there is anaction model that results in the post-condition φ”, and shows that this quantifier is equivalent to the refinement quantifier of van Ditmarsch and French.

Propositional quantification in logics of contingency

This work defines contingency logic with arbitrary announcement and presents an axiomatisation and shows its completeness by adapting a method to demonstrate completeness of arbitrary public announcement logic.

Arbitrary Public Announcement Logic with Memory

This work introduces Arbitrary Public Announcement Logic with Memory, and presents a complete recursive axiomatization, that includes a natural finitary rule, and examines this logic’s expressivity and the appropriate notion of bisimulation.

Arbitrary arrow update logic

Recapturing Dynamic Logic of Relation Changers via Bounded Morphisms

The present contribution shows that a Hilbert-style axiomatization for dynamic logic of relation changers is complete for the standard Kripke semantics not by a well-known rewriting technique but by

References

SHOWING 1-10 OF 86 REFERENCES

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.

Refinement Quantified Logics of Knowledge

Refinement Quantifiers for Logics of Belief and Knowledge

Modal logics are extensions of propositional logic, with which one can qualify the truth of statements with operators known as modalities. Epistemic logic is a variant of modal logic, commonly known

A Note on Bisimulation Quantifiers and Fixed Points over Transitive Frames

It is shown that the answers to three basic questions regarding the extension of modal logic with a special kind of propositional quantifiers over arbitrary classes of frames, known as bisimulation quantifiers, do not generalize to arbitrary classes, but they do generalize if the authors restrict to classes of (finite) transitive or transitive and reflexive frames.

Logical questions concerning the μ-calculus: Interpolation, Lyndon and Łoś-Tarski

A classical logician's view of the μ-calculus is taken: a new logic should not be allowed into the community of logics without at least considering the standard questions that any logic is bothered with.

An axiomatization of bisimulation quantifiers via the mu-calculus

Arbitrary Action Model Logic and Action Model Synthesis

  • James Hales
  • Computer Science
    2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
  • 2013
This work introduces an extension of the action model logic of Baltag, Moss and Solecki with an action model quantifier, ∃φ which stands for “there is anaction model that results in the post-condition φ”, and shows that this quantifier is equivalent to the refinement quantifier of van Ditmarsch and French.

20 Years of Modal and Mixed Specifications

The nature and utility of modal and mixed specifications are explained, relate them to other formalisms, showcase some of their established applications, and mention some existing tool support.

Dynamic Epistemic Logic

This book provides various logics to support formal specifications of multi-agent systems, including proof systems, and discusses various results on the expressive power of the logics presented.

Simulation and Information: Quantifying over Epistemic Events

A multi-agent logic of knowledge with time where F? stands for "there is an informative event after which ?" and the former provides a correspondence with bisimulation quantifiers in a setting with epistemic operators.
...