Towards a Coalgebraic Interpretation of Propositional Dynamic Logic
نویسنده
چکیده
The interpretation of propositional dynamic logic (PDL) through Kripke models requires the relations constituting the interpreting Kripke model to closely observe the syntax of the modal operators. This poses a significant challenge for an interpretation of PDL through stochastic Kripke models, because the programs’ operations do not always have a natural counterpart in the set of stochastic relations. We use rewrite rules for building up an interpretation of PDL. It is shown that each program corresponds to an essentially unique irreducible tree, which in turn is assigned a predicate lifting, serving as the program’s interpretation. The paper establishes and studies this interpretation. It discusses the expressivity of probabilistic models for PDL and relates properties like logical and behavioral equivalence or bisimilarity to the corresponding properties of a Kripke model for a closely related non-dynamic logic of the Hennessy-Milner type.
منابع مشابه
Towards Coalgebraic Specification of Rewriting Theories
We describe a coalgebraic perspective on models of rewriting logic theories. After establishing a soundness and completeness result, we show how one can use modal logics for coalgebras to reason about the rewrite process. The approach is semantics-driven in the sense that the logic we propose is tailored to the class of models we consider.
متن کاملWeak Completeness of Coalgebraic Dynamic Logics
We present a coalgebraic generalisation of Fischer and Ladner’s Propositional Dynamic Logic (PDL) and Parikh’s Game Logic (GL). In earlier work, we proved a generic strong completeness result for coalgebraic dynamic logics without iteration. The coalgebraic semantics of such programs is given by a monad T , and modalities are interpreted via a predicate lifting λ whose transpose is a monad morp...
متن کاملEquality propositional logic and its extensions
We introduce a new formal logic, called equality propositional logic. It has two basic connectives, $boldsymbol{wedge}$ (conjunction) and $equiv$ (equivalence). Moreover, the $Rightarrow$ (implication) connective can be derived as $ARightarrow B:=(Aboldsymbol{wedge}B)equiv A$. We formulate the equality propositional logic and demonstrate that the resulting logic has reasonable properties such a...
متن کاملOn a purely categorical framework for coalgebraic modal logic
A category CoLog of distributive laws is introduced to unify different approaches to modal logic for coalgebras, based merely on the presence of a contravariant functor P that maps a state space to its collection of predicates. We show that categorical constructions, including colimits, limits, and compositions of distributive laws as a tensor product, in CoLog generalise and extend existing co...
متن کاملCoalgebraic Epistemic Update Without Change of Model
We present a coalgebraic semantics for reasoning about information update in multi-agent systems. The novelty is that we have one structure for both states and actions and thus our models do not involve the ”change-of-model” phenomena that arise when using Kripke models. However, we prove that the usual models can be constructed from ours by categorical adjunction. The generality and abstractio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1109.3685 شماره
صفحات -
تاریخ انتشار 2011