Algebra and Coalgebra in Computer Science
From MaRDI portal
Publication:5492822
DOI10.1007/11548133zbMath1151.18001OpenAlexW249899439MaRDI QIDQ5492822
Publication date: 20 October 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11548133
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Temporal logic (03B44) Categories of machines, automata (18B20) Eilenberg-Moore and Kleisli constructions for monads (18C20)
Related Items (12)
Quotients of Bounded Natural Functors ⋮ Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence ⋮ The \({\mathcal {HS}} = {\mathcal {SH}}\) problem for coalgebras ⋮ A point-free perspective on lax extensions and predicate liftings ⋮ Hybrid logic with the difference modality for generalisations of graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On minimal coalgebras ⋮ Rigidity of unary algebras and its application to the \({\mathcal {HS} = \mathcal {SH}}\) problem ⋮ Unnamed Item ⋮ A coalgebraic view on reachability
This page was built for publication: Algebra and Coalgebra in Computer Science
