Coalgebraic techniques are applied to the supervisory control of discrete-event systems with partial observations. Classical notions from concurrency theory are specialized to control theory. The concept of weak transitions enables the relational characterization of observability and gives rise to a coalgebraic formulation of the necessary and sufficient conditions for the existence of a superv...

We define a graded twisted-coassociative coproduct on the tensor algebra TW of any Zn-graded vector space W . If W is the desuspension space ↓V of a graded vector space V , the coderivations (resp. quadratic “degree 1” codifferentials, arbitrary odd codifferentials) of this coalgebra are 1to-1 with sequences πs, s ≥ 1, of s-linear maps on V (resp. Zn-graded Loday structures on V , sequences tha...

We propose a coalgebraic model for constructing and reasoning about state-based protocols that implement efficient reductions among random processes. provide basic tools allow to be constructed in compositional way analyzed terms of the tradeoff between state loss entropy. show how use these construct various entropy-conserving

Algebras and coalgebras are fundamental notions for large parts of mathematics. The basic constructions from universal algebra are now expressed in the language of categories and thus are accessible to classical algebraists and topologists as well as to logicians and computer scientists. Some of them have developed specialised parts of the theory and often reinvented constructions already known...

Using the theory of coalgebra, we introduce a uniform framework for adding modalities to language propositional geometric logic. Models this logic are based on coalgebras an endofunctor some full subcategory category topological spaces and continuous functions. We investigate derivation systems, soundness completeness such modal logics, specify method lifting Set, accompanied by collection pred...