Recommendations
Cites work
- scientific article; zbMATH DE number 2185665 (Why is no real title available?)
- scientific article; zbMATH DE number 4137843 (Why is no real title available?)
- scientific article; zbMATH DE number 3922927 (Why is no real title available?)
- scientific article; zbMATH DE number 3952838 (Why is no real title available?)
- scientific article; zbMATH DE number 3967883 (Why is no real title available?)
- scientific article; zbMATH DE number 4028448 (Why is no real title available?)
- scientific article; zbMATH DE number 4033710 (Why is no real title available?)
- scientific article; zbMATH DE number 4047683 (Why is no real title available?)
- scientific article; zbMATH DE number 4065241 (Why is no real title available?)
- scientific article; zbMATH DE number 1189281 (Why is no real title available?)
- scientific article; zbMATH DE number 3716749 (Why is no real title available?)
- scientific article; zbMATH DE number 3716792 (Why is no real title available?)
- scientific article; zbMATH DE number 3720983 (Why is no real title available?)
- scientific article; zbMATH DE number 42735 (Why is no real title available?)
- scientific article; zbMATH DE number 108434 (Why is no real title available?)
- scientific article; zbMATH DE number 3495581 (Why is no real title available?)
- scientific article; zbMATH DE number 3549200 (Why is no real title available?)
- scientific article; zbMATH DE number 1231627 (Why is no real title available?)
- scientific article; zbMATH DE number 1231631 (Why is no real title available?)
- scientific article; zbMATH DE number 1231635 (Why is no real title available?)
- scientific article; zbMATH DE number 1231637 (Why is no real title available?)
- scientific article; zbMATH DE number 1304993 (Why is no real title available?)
- scientific article; zbMATH DE number 626734 (Why is no real title available?)
- scientific article; zbMATH DE number 1064116 (Why is no real title available?)
- scientific article; zbMATH DE number 1086715 (Why is no real title available?)
- scientific article; zbMATH DE number 1107487 (Why is no real title available?)
- scientific article; zbMATH DE number 952378 (Why is no real title available?)
- scientific article; zbMATH DE number 2102773 (Why is no real title available?)
- scientific article; zbMATH DE number 821282 (Why is no real title available?)
- scientific article; zbMATH DE number 234018 (Why is no real title available?)
- scientific article; zbMATH DE number 3367095 (Why is no real title available?)
- A calculus of communicating systems
- A co-induction principle for recursively defined domains
- A coinduction principle for recursive data types based on bisimulation
- A domain equation for bisimulation
- A final coalgebra theorem
- A general Galois theory for cofunctions and corelations
- A lattice-theoretical fixpoint theorem and its applications
- A small final coalgebra theorem
- Additions and corrections to ``Terminal coalgebras in well-founded set theory
- Algebraic specification of data types: A synthetic approach
- An approach to object semantics based on terminal co-algebras
- Bisimulation for probabilistic transition systems: A coalgebraic approach
- Bisimulation from open maps
- Bisimulation through probabilistic testing
- Co-induction in relational semantics
- Coalgebraic logic
- Coalgebraic methods in computer science, CMCS '98. Proceedings of the 1st workshop, Lisbon, Portugal, March 28--29, 1998
- Covarieties and complete covarieties
- Final semantics for a higher order concurrent language
- Final universes of processes
- Formal verification of parallel programs
- Machines in a category
- Mechanizing coinduction and corecursion in higher-order logic
- Mongruences and cofree coalgebras
- On the Foundations of Corecursion
- Parametrized data types do not need highly constrained parameters
- Processes and hyperuniverses
- Processes as terms: non-well-founded models for bisimulation
- Reactive, generative, and stratified models of probabilistic processes
- Relational properties of domains
- Solving reflexive domain equations in a category of complete metric spaces
- Structural induction and coinduction in a fibrational setting
- Structured operational semantics and bisimulation as a congruence
- Terminal coalgebras in well-founded set theory
- Terminal metric spaces of finitely branching and image finite linear processes
- The Category-Theoretic Solution of Recursive Domain Equations
- Universal coalgebra and categories of transition systems
Cited in
(only showing first 100 items - show all)- Categorically algebraic topology versus universal topology
- Recursive coalgebras from comonads
- Coalgebras as types determined by their elimination rules
- Constructive logical characterizations of bisimilarity for reactive probabilistic systems
- Completeness for \(\mu\)-calculi: a coalgebraic approach
- A description based on languages of the final non-deterministic automaton
- Comprehension for coalgebras
- Duality for some categories of coalgebras.
- scientific article; zbMATH DE number 7471679 (Why is no real title available?)
- Probabilistic mediator: a coalgebraic perspective
- A new foundation for finitary corecursion. The locally finite fixpoint and its properties
- Mongruences and cofree coalgebras
- Covarieties and complete covarieties
- Hausdorff coalgebras
- Smooth coalgebra: testing vector analysis
- Hybrid automata as coalgebras
- The converse of a stochastic relation
- scientific article; zbMATH DE number 7199591 (Why is no real title available?)
- Equivalence co-relatios and co-congruences of co-algebras
- Limits in categories of Vietoris coalgebras
- Formalization of Data Flow Computing and a Coinductive Approach to Verifying Flowware Synthesis
- Finite behaviours and finitary corecursion
- (In)finite trace equivalence of probabilistic transition systems
- Monoidal computer. III: A coalgebraic view of computability and complexity (extended abstract)
- Institutionalising many-sorted coalgebraic modal logic
- Proper functors and fixed points for finite behaviour
- Coalgebraic trace semantics via forgetful logics
- Duality of equations and coequations via contravariant adjunctions
- A complete logic for behavioural equivalence in coalgebras of finitary set functors
- Tree-functors, determinacy and bisimulations
- On coalgebra of real numbers
- How to reason coinductively informally
- scientific article; zbMATH DE number 7199590 (Why is no real title available?)
- On induction principles for partial orders
- scientific article; zbMATH DE number 7577568 (Why is no real title available?)
- Using coalgebras and the Giry monad for interpreting game logics -- a tutorial
- Coalgebra morphisms subsume open maps
- CSP, partial automata, and coalgebras.
- On institutions for modular coalgebraic specifications.
- A coinductive completeness proof for the equivalence of recursive types
- A generalized partition refinement algorithm, instantiated to language equivalence checking for weighted automata
- Coalgebraic logics \& duality
- Long-term values in Markov decision processes, (co)algebraically
- Undecidability of equality for codata types
- Coalgebraic minimization of automata by initiality and finality
- Bisimulation on Markov processes over arbitrary measurable spaces
- From Lawvere to Brandenburger-Keisler: interactive forms of diagonalization and self-reference
- Languages and models for hybrid automata: a coalgebraic perspective
- Weak completeness of coalgebraic dynamic logics
- A Complete Logic for Behavioural Equivalence in Coalgebras of Finitary Set Functors
- A new foundation for finitary corecursion and iterative algebras
- Choice structures in games
- Final coalgebras and a solution theorem for arbitrary endofunctors
- Observational ultraproducts of polynomial coalgebras.
- Extensional quotient coalgebras
- Bisimulation maps in presheaf categories
- Semantic Foundations for Deterministic Dataflow and Stream Processing
- Interpreted systems and Kripke models for multiagent systems from a categorical perspective
- Formal Methods in Software and Systems Modeling
- scientific article; zbMATH DE number 7649895 (Why is no real title available?)
- A quantified coalgebraic van Benthem theorem
- On the complexity of stream equality
- A calculus of concurrent graph-rewriting processes
- A proof of Moessner's theorem by coinduction
- Hennessy-Milner and van Benthem for instantial neighbourhood logic
- Practical coinduction
- Problems of constructing intelligent systems. Intelligent modeling
- Realization of coinductive types
- Coinductive predicates and final sequences in a fibration
- Stream differential equations: specification formats and solution methods
- Coinduction in concurrent timed systems
- Generalised coinduction
- Non-well-founded deduction for induction and coinduction
- A semantic model for interacting cyber-physical systems
- From global to local state, coalgebraically and compositionally
- Accessible set functors are universal
- Free-lattice functors weakly preserve epi-pullbacks
- Monotone subintuitionistic logic: duality and transfer results
- Bisimulation and coinduction enhancements: a historical perspective
- Isomorphism theorems for coalgebras
- Coalgebra and abstraction
- Up-to techniques for branching bisimilarity
- Pre-Galois connection on coalgebras for generic component refinement
- On \(\mathbf{MV} \)-coalgebras over the category of BL-algebras
- A parameterization process: from a functorial point of view
- Nominal automata with name binding
- Distributive laws for monotone specifications
- Distributive laws for monotone specifications
- scientific article; zbMATH DE number 7440178 (Why is no real title available?)
- scientific article; zbMATH DE number 6864542 (Why is no real title available?)
- scientific article; zbMATH DE number 7649955 (Why is no real title available?)
- scientific article; zbMATH DE number 7566077 (Why is no real title available?)
- scientific article; zbMATH DE number 7649944 (Why is no real title available?)
- Final semantics for decorated traces
- A single complete relational rule for coalgebraic refinement
- Integrating induction and coinduction via closure operators and proof cycles
- A (co)algebraic theory of succinct automata
- Coalgebraic semantics for nominal automata
- Predicate and relation liftings for coalgebras with side effects: an application in coalgebraic modal logic
- Saturated Kripke structures as Vietoris coalgebras
This page was built for publication: Universal coalgebra: A theory of systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1583483)
