Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Proof systems for satisfiability in Hennessy-Milner logic with recursion
Theoretical Computer Science - Special issue on the Thirteenth Colleque sur les Arbres en Alge`bre et en Programmation Nancy, March 1988
Terminal coalgebras in well-founded set theory
Theoretical Computer Science
Modal logics for mobile processes
Selected papers of the 3rd workshop on Concurrency and compositionality
A modal logic for message passing processes
Acta Informatica
Objects and classes, co-algebraically
Object orientation with parallelism and persistence
Universal coalgebra: a theory of systems
Theoretical Computer Science - Modern algebra and its applications
Covarieties and complete covarieties
Theoretical Computer Science
Specifying coalgebras with modal logic
Theoretical Computer Science
From modal logic to terminal coalgebras
Theoretical Computer Science
Equational axiomatizability for coalgebra
Theoretical Computer Science
What is the coalgebraic analogue of Birkhoff's variety theorem?
Theoretical Computer Science
Communication and Concurrency
Modal Logic and Process Algebra: A Bisimulation Perspective
Modal Logic and Process Algebra: A Bisimulation Perspective
Handbook of Process Algebra
Mongruences and Cofree Coalgebras
AMAST '95 Proceedings of the 4th International Conference on Algebraic Methodology and Software Technology
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Category Theory and Computer Science
On Observing Nondeterminism and Concurrency
Proceedings of the 7th Colloquium on Automata, Languages and Programming
Universal coalgebra: a theory of systems
Universal coalgebra: a theory of systems
On varieties and covarieties in a category
Mathematical Structures in Computer Science
Modal operators and the formal dual of Birkhoff's completeness theorem
Mathematical Structures in Computer Science
Covarieties of coalgebras: comonads and coequations
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
Hi-index | 0.00 |
A class $K$ of coalgebras for an endofunctor $T\,{:}\,\Set\to\Set$ is a behavioural covariety if it is closed under disjoint unions and images of bisimulation relations (hence closed under images and domains of coalgebraic morphisms, including subcoalgebras). $K$ may be thought of as the class of all coalgebras that satisfy some computationally significant property. In any logical system suitable for specifying properties of state-transition systems in the Hennessy–Milner style, each formula will define a class of models that is a behavioural covariety.Assuming that the forgetful functor on $T$-coalgebras has a right adjoint, providing for the construction of cofree coalgebras, and letting $\G^T$ be the comonad arising from this adjunction, we show that behavioural covarieties $K$ are (isomorphic to) the Eilenberg–Moore categories of coalgebras for certain comonads $\G^K$ naturally associated with $\G^T$. These are called pure subcomonads of $\G^T$, and a categorical characterisation of them is given that involves a pullback condition on the naturality squares of a transformation from $\G^K$ to $\G^T$. We show that there is a bijective correspondence between behavioural covarieties of $T$-coalgebras and isomorphism classes of pure subcomonads of $\G^T$.