Fusion is arguably the simplest way to combine modal logics. For normal modal logics with Kripke semantics, many properties such as completeness and decidability are known to trans...
This paper presents a modular framework for the specification of certain inductivelydefined coalgebraic types. Modal logics for coalgebras of polynomial endofunctors on the catego...
Weighted transition systems are defined, parametrized by a commutative monoid of weights. These systems are further understood as coalgebras for functors of a specific form. A gene...
The aim of this paper is an integration of graph grammars with different kinds of behavioural constraints, in particular with temporal logic constraints. Since the usual algebraic ...
Reiko Heckel, Hartmut Ehrig, Uwe Wolter, Andrea Co...
We give two generic proofs for cut elimination in propositional modal logics, interpreted over coalgebras. We first investigate semantic coherence conditions between the axiomati...