Related papers: Relating coalgebraic notions of bisimulation
Trace semantics has been defined for various kinds of state-based systems, notably with different forms of branching such as non-determinism vs. probability. In this paper we claim to identify one underlying mathematical structure behind…
We introduce the notion of filtration between topologies and study its stabilization properties. Descriptive set theoretic complexity plays a role in this study. Filtrations lead to natural transfinite sequences approximating a given…
For the minimization of state-based systems (i.e. the reduction of the number of states while retaining the system's semantics), there are two obvious aspects: removing unnecessary states of the system and merging redundant states in the…
This article contains a review of categorifications of semisimple representations of various rings via abelian categories and exact endofunctors on them. A simple definition of an abelian categorification is presented and illustrated with…
An algebraic deformation theory of coalgebra morphisms is constructed.
In this note, we observe a relation between dialgebras (in particular, Leibniz algebras) and conformal algebras. The purpose is to show how the methods of conformal algebras help solving problems on dialgebras, and, conversely, how the…
In this note we study dual coalgebras of algebras over arbitrary (noetherian) commutative rings. We present and study a generalized notion of coreflexive comodules and use the results obtained for them to characterize the so called…
A model structure on the category of (small) bigroupoids and pseudofunctors is constructed. In this model structure, every object is cofibrant. In order to keep certain calculations of manageable size, a coherence theorem for bigroupoids…
We study a class of overdetermined algebraic systems of equations. We prove that the number of distinct solutions equals to the maximal possible if and only if certain matrices are commuting and semisimple. This gives a characterization of…
We study many-valued coalgebraic logics with semi-primal algebras of truth-degrees. We provide a systematic way to lift endofunctors defined on the variety of Boolean algebras to endofunctors on the variety generated by a semi-primal…
Five algebraic notions of termination are formalised, analysed and compared: wellfoundedness or Noetherity, L\"ob's formula, absence of infinite iteration, absence of divergence and normalisation. The study is based on modal semirings,…
In this note, our goal is to describe the concept of generalized derivations in the context of BiHom-supertrialgebras. We provide a comprehensive analysis of the properties and applications of these generalized derivations, including their…
FuTS, state-to-function transition systems are generalizations of labeled transition systems and of familiar notions of quantitative semantical models as continuous-time Markov chains, interactive Markov chains, and Markov automata. A…
Bialgebrae provide an abstract framework encompassing the semantics of different kinds of computational models. In this paper we propose a bialgebraic approach to the semantics of logic programming. Our methodology is to study logic…
For the minimization of state-based systems (i.e. the reduction of the number of states while retaining the system's semantics), there are two obvious aspects: removing unnecessary states of the system and merging redundant states in the…
Many combinatorial proofs rely on induction. When these proofs are formulated in traditional language, they can be bulky and unmanageable. Coalgebras provide a language which can reduce reduce many inductive proofs in graded poset theory to…
A notion of an algebroid - a generalization of a Lie algebroid structure is introduced. We show that many objects of the differential calculus on a manifold M associated with the canonical Lie algebroid structure on T^M can be obtained in…
We introduce a generalized notion of inference system to support more flexible interpretations of recursive definitions. Besides axioms and inference rules with the usual meaning, we allow also coaxioms, which are, intuitively, axioms which…
Field/circuit coupling is a common approach when a lumped representation of a certain electrotechnical device is not accurate enough. To exploit existing code and underlying properties of the coupled systems, cosimulation techniques such as…
Categorical studies of recursive data structures and their associated reasoning principles have mostly focused on two extremes: initial algebras and induction, and final coalgebras and coinduction. In this paper we study their in-betweens.…