. A first basic fact in algebra (or, in algebraic specification) is the existence of free algebras, as suitable sets of terms. In coalgebraic specification, terminal coalgebras are known to exist in Sets (and in other categories) via the standard limit construction. Here we characterize these terminal coalgebras as sets of "trees of observations". It is a standard result that elements of (the carrier of) a coalgebra are bisimilar (i.e. indistinguishable via the coalgebra operations) if and only if they have the same interpretation in the terminal coalgebra. This now becomes: if and only if they have the same tree of observations. Instead of putting emphasis on bisimulation---which is a rather evasive notion---we consider its negat...
In our article [1] we introduced the representation of final coalgebras, which correspond to non-wel...
AbstractThe realm of approaches to operational descriptions and equivalences for concurrent systems ...
AbstractWe propose a coalgebraic definition of weak bisimulation for a class of coalgebras obtained ...
A bisimulation for a coalgebra of a functor on the category of sets can bedescribed via a coalgebra ...
textabstractIn the semantics of programming, finite data types such as finite lists, have traditiona...
AbstractThis paper contains a novel approach to observational equivalence for coalgebras. We describ...
AbstractIn the semantics of programming, finite data types such as finite lists, have traditionally ...
AbstractIn this paper we show that it is possible to model observable behaviour of coalgebras indepe...
We present a systematic study of bisimulation-up-to techniques for coalgebras. This enhances the bis...
We propose a coalgebraic definition of weak bisimulation for a class of coalgebras obtained from bif...
The realm of approaches to operational descriptions and equivalences for concurrent systems in the l...
The realm of approaches to operational descriptions and equivalences for concurrent systems in the l...
. Coalgebraic specifications are used to formally describe the behaviour of classes in object-orient...
AbstractIn our paper [RM02a] we describe an approach to weak bisimulation for coalgebras and show th...
The realm of approaches to operational descriptions and equivalences for concurrent systems in the l...
In our article [1] we introduced the representation of final coalgebras, which correspond to non-wel...
AbstractThe realm of approaches to operational descriptions and equivalences for concurrent systems ...
AbstractWe propose a coalgebraic definition of weak bisimulation for a class of coalgebras obtained ...
A bisimulation for a coalgebra of a functor on the category of sets can bedescribed via a coalgebra ...
textabstractIn the semantics of programming, finite data types such as finite lists, have traditiona...
AbstractThis paper contains a novel approach to observational equivalence for coalgebras. We describ...
AbstractIn the semantics of programming, finite data types such as finite lists, have traditionally ...
AbstractIn this paper we show that it is possible to model observable behaviour of coalgebras indepe...
We present a systematic study of bisimulation-up-to techniques for coalgebras. This enhances the bis...
We propose a coalgebraic definition of weak bisimulation for a class of coalgebras obtained from bif...
The realm of approaches to operational descriptions and equivalences for concurrent systems in the l...
The realm of approaches to operational descriptions and equivalences for concurrent systems in the l...
. Coalgebraic specifications are used to formally describe the behaviour of classes in object-orient...
AbstractIn our paper [RM02a] we describe an approach to weak bisimulation for coalgebras and show th...
The realm of approaches to operational descriptions and equivalences for concurrent systems in the l...
In our article [1] we introduced the representation of final coalgebras, which correspond to non-wel...
AbstractThe realm of approaches to operational descriptions and equivalences for concurrent systems ...
AbstractWe propose a coalgebraic definition of weak bisimulation for a class of coalgebras obtained ...