AbstractBisimulations, behavioral equivalence and logical equivalence are investigated for stochastic T-coalgebras that interpret coalgebraic logic which is defined in terms of predicate liftings. We investigate the conditions for the functor under which these notions of equivalence are related by discussing congruences for the underlying stochastic relation. It is demonstrated that logics as diverse as continuous time stochastic logic and general modal logics can be usefully approached through coalgebraic methods
Coalgebra develops a general theory of transition systems, parametric in a functor T; the functor T ...
htmlabstractLabeled state-to-function transition systems, FuTS for short, admit multiple transition...
Behavioral equivalences are a means to establish whether computing systems possess the same properti...
Abstract. We study the relationship between logical and behavioral equivalence for coalgebras on gen...
AbstractWe study the relationship between logical and behavioral equivalence for coalgebras on gener...
Abstract We study coalgebras for endofunctors on the category of an-alytic spaces. Prominent example...
Combining coalgebraic reasoning, stochastic systems and logic, this volume presents the principles o...
AbstractWe study the relationship between logical and behavioral equivalence for coalgebras on gener...
Abstract This paper presents a logical characterisation of coalgebraic behavioural equivalence. The ...
We study coalgebraic modal logic to characterise behavioural equivalence in the presence of side eff...
AbstractWe survey the work on both discrete and continuous-space probabilistic systems as coalgebras...
We relate three different, but equivalent, ways to characterise behavioural equivalence for set coal...
AbstractWe present a generalization of modal logic to logics which are interpreted on coalgebras of ...
Abstract Labeled state-to-function transition systems, FuTS for short, admit multiple transition sch...
Coalgebra develops a general theory of transition systems, parametric in a functor T; the functor T ...
Coalgebra develops a general theory of transition systems, parametric in a functor T; the functor T ...
htmlabstractLabeled state-to-function transition systems, FuTS for short, admit multiple transition...
Behavioral equivalences are a means to establish whether computing systems possess the same properti...
Abstract. We study the relationship between logical and behavioral equivalence for coalgebras on gen...
AbstractWe study the relationship between logical and behavioral equivalence for coalgebras on gener...
Abstract We study coalgebras for endofunctors on the category of an-alytic spaces. Prominent example...
Combining coalgebraic reasoning, stochastic systems and logic, this volume presents the principles o...
AbstractWe study the relationship between logical and behavioral equivalence for coalgebras on gener...
Abstract This paper presents a logical characterisation of coalgebraic behavioural equivalence. The ...
We study coalgebraic modal logic to characterise behavioural equivalence in the presence of side eff...
AbstractWe survey the work on both discrete and continuous-space probabilistic systems as coalgebras...
We relate three different, but equivalent, ways to characterise behavioural equivalence for set coal...
AbstractWe present a generalization of modal logic to logics which are interpreted on coalgebras of ...
Abstract Labeled state-to-function transition systems, FuTS for short, admit multiple transition sch...
Coalgebra develops a general theory of transition systems, parametric in a functor T; the functor T ...
Coalgebra develops a general theory of transition systems, parametric in a functor T; the functor T ...
htmlabstractLabeled state-to-function transition systems, FuTS for short, admit multiple transition...
Behavioral equivalences are a means to establish whether computing systems possess the same properti...