AbstractIn this paper we show that it is possible to model observable behaviour of coalgebras independently from their internal dynamics, but within the general framework of representing behaviour by a map into a “final” coalgebra.In the first part of the paper we characterise Set-endofunctors F with the property that bisimilarity of elements of F-coalgebras coincides with having the same observable behaviour. We show that such functors have the final coalgebra of a rather simple nature, and preserve some weak pullbacks. We also show that this is the case if and only if F-bisimilarity corresponds to logical equivalence in the finitary fragment of the coalgebraic logic.In the second part of the paper, we present a construction of a “final” c...
We propose a coalgebraic definition of weak bisimulation for a class of coalgebras obtained from bif...
AbstractLogical definability is investigated for certain classes of coalgebras related to state-tran...
. A first basic fact in algebra (or, in algebraic specification) is the existence of free algebras, ...
AbstractIn this paper we show that it is possible to model observable behaviour of coalgebras indepe...
We relate three different, but equivalent, ways to characterise behavioural equivalence for set coal...
Abstract This paper presents a logical characterisation of coalgebraic behavioural equivalence. The ...
The existence of a final coalgebra is equivalent to the existence of a formal logic with a set (smal...
AbstractWe propose a coalgebraic definition of weak bisimulation for a class of coalgebras obtained ...
AbstractWe present a generalization of modal logic to logics which are interpreted on coalgebras of ...
Coalgebras for a functor model different types of transition systems in auniform way. This paper foc...
We propose a coalgebraic definition of weak bisimulation for classes of coalgebras obtained from bif...
AbstractIn our paper [RM02a] we describe an approach to weak bisimulation for coalgebras and show th...
AbstractWe investigate languages to describe coalgebras on datafunctors. First, a syntactical charac...
We propose a coalgebraic definition of weak bisimulation for classes of coalgebras obtained from bif...
AbstractIn [19] Rutten introduced the notion of weak bisimulations and weak bisimilarity for coalgeb...
We propose a coalgebraic definition of weak bisimulation for a class of coalgebras obtained from bif...
AbstractLogical definability is investigated for certain classes of coalgebras related to state-tran...
. A first basic fact in algebra (or, in algebraic specification) is the existence of free algebras, ...
AbstractIn this paper we show that it is possible to model observable behaviour of coalgebras indepe...
We relate three different, but equivalent, ways to characterise behavioural equivalence for set coal...
Abstract This paper presents a logical characterisation of coalgebraic behavioural equivalence. The ...
The existence of a final coalgebra is equivalent to the existence of a formal logic with a set (smal...
AbstractWe propose a coalgebraic definition of weak bisimulation for a class of coalgebras obtained ...
AbstractWe present a generalization of modal logic to logics which are interpreted on coalgebras of ...
Coalgebras for a functor model different types of transition systems in auniform way. This paper foc...
We propose a coalgebraic definition of weak bisimulation for classes of coalgebras obtained from bif...
AbstractIn our paper [RM02a] we describe an approach to weak bisimulation for coalgebras and show th...
AbstractWe investigate languages to describe coalgebras on datafunctors. First, a syntactical charac...
We propose a coalgebraic definition of weak bisimulation for classes of coalgebras obtained from bif...
AbstractIn [19] Rutten introduced the notion of weak bisimulations and weak bisimilarity for coalgeb...
We propose a coalgebraic definition of weak bisimulation for a class of coalgebras obtained from bif...
AbstractLogical definability is investigated for certain classes of coalgebras related to state-tran...
. A first basic fact in algebra (or, in algebraic specification) is the existence of free algebras, ...