Displaying similar documents to “Coalgebras for binary methods : properties of bisimulations and invariants”

Integrating observational and computational features in the specification of state-based, dynamical systems

Corina Cîrstea (2001)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

We present an abstract equational framework for the specification of systems having both observational and computational features. Our approach is based on a clear separation between the two categories of features, and uses algebra, respectively coalgebra to formalise them. This yields a coalgebraically-defined notion of observational indistinguishability, as well as an algebraically-defined notion of reachability under computations. The relationship between the computations yielding...

The structure of the tensor product of 𝔽 2 [ - ] with a finite functor between 𝔽 2 -vector spaces

Geoffrey M. L. Powell (2000)

Annales de l'institut Fourier

Similarity:

The paper studies the structure of functors I F in the category of functors from finite dimensional 𝔽 2 -vector spaces to 𝔽 2 -vector spaces, where F is a finite functor and I is the injective functor V 𝔽 2 V * . A detection theorem is proved for sub-functors of such functors, which is the basis of the proof that the functors I F are artinian of type one.