In this paper we introduce and investigate top (bi)comodules of corings, that can be considered as dual to top (bi)modules of rings. The fully coprime spectra of such (bi)comodules attains a Zariski topology, defined in a way dual to that of defining the Zariski topology on the prime spectra of (commutative) rings. We restrict our attention in this paper to duo (bi)comodules (satisfying suitabl...

Strong bisimulation for labelled transition systems is one ofthe most fundamental equivalences in process algebra, and has beengeneralised to numerous classes of systems that exhibit richer transi-tion behaviour. Nearly all of the ensuing notions are instances of themore general notion of coalgebraic bisimulation. Weak bisimulation, how-ever, has so far been much less amenab...

Jonsson and Larsen’s notion of probabilistic simulation is studied from a coalgebraic perspective. The notion is compared with two generic coalgebraic definitions of simulation: Hughes and Jacobs’ one, and the one introduced previously by the author. We show that the first almost coincides with the second, and that the second is a special case of the last. We investigate implications of this ch...

This paper presents a first step towards completeness-viacanonicity results for coalgebraic modal logics. Specifically, we consider the relationship between classes of coalgebras for ω-accessible endofunctors and logics defined by Sahlqvist-like frame conditions. Our strategy is based on conjoining two well-known approaches: we represent accessible functors as (equational) quotients of polynomi...

We present a sound and complete axiomatization of finite complete trace semantics for generative probabilistic transition systems. Our approach is coalgebraic, which opens the door to axiomatize other types of systems. In order to prove soundness and completeness, we employ determinization and show that coalgebraic traces can be recovered via determinization, a result interesting in itself. The...

Stream automata (also called ω-automata) and ω-regular languages are of paramount importance in Computer Science and Logic. A coalgebraic treatment of these structures has not been given yet. We study a simple two-sorted setting where deterministic Muller automata can be cast as coalgebras, so that coalgebraic bisimilarity coincides with language equivalence. From this characterisation, we deri...