Simulations in coalgebra
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 29047 (Why is no real title available?)
- scientific article; zbMATH DE number 1231637 (Why is no real title available?)
- scientific article; zbMATH DE number 1497882 (Why is no real title available?)
- scientific article; zbMATH DE number 1499095 (Why is no real title available?)
- scientific article; zbMATH DE number 194916 (Why is no real title available?)
- scientific article; zbMATH DE number 2087345 (Why is no real title available?)
- A co-induction principle for recursively defined domains
- A coalgebraic presentation of structured transition systems
- A coinduction principle for recursive data types based on bisimulation
- Coalgebraic theories of sequences in PVS
- Final Coalgebras are Ideal Completions of Initial Algebras
- Fixpoint semantics and simulation
- Forward and backward simulations. I. Untimed Systems
- Simulations in coalgebra
- Structural induction and coinduction in a fibrational setting
- The Category-Theoretic Solution of Recursive Domain Equations
- The lambda calculus. Its syntax and semantics. Rev. ed.
- The temporal logic of coalgebras via Galois algebras
- Universal coalgebra: A theory of systems
Cited in
(38)- Relational presheaves, change of base and weak simulation
- A point-free perspective on lax extensions and predicate liftings
- scientific article; zbMATH DE number 5181783 (Why is no real title available?)
- scientific article; zbMATH DE number 7471679 (Why is no real title available?)
- Probabilistic mediator: a coalgebraic perspective
- Simulations in coalgebra
- Weighted and branching bisimilarities from generalized open maps
- Lax extensions of coalgebra functors and their logic
- Non-strongly stable orders also define interesting simulation relations
- Formalization of Data Flow Computing and a Coinductive Approach to Verifying Flowware Synthesis
- On bisimilarity in lambda calculi with continuous probabilistic choice
- A calculus for generic, QoS-aware component composition
- Preorders on monads and coalgebraic simulations
- A Characterisation of Expressivity for Coalgebraic Bisimulation and Simulation
- Distributive laws for monotone specifications
- Distributive laws for monotone specifications
- Quantitative simulations by matrices
- (Bi)simulations up-to characterise process semantics
- A single complete relational rule for coalgebraic refinement
- Processes as formal power series: a coinductive approach to denotational semantics
- Similarity quotients as final coalgebras
- Corecursion up-to via causal transformations
- scientific article; zbMATH DE number 7566075 (Why is no real title available?)
- Bisimulation proof methods in a path-based specification language for polynomial coalgebras
- scientific article; zbMATH DE number 7559483 (Why is no real title available?)
- Coalgebraic simulations and congruences
- Reflection and Preservation of Properties in Coalgebraic (bi)Simulations
- A general account of coinduction up-to
- New Bisimulation Semantics for Distributed Systems
- Transitivity and difunctionality of bisimulations
- Extending set functors to generalised metric spaces
- Structural congruence for bialgebraic semantics
- Relation lifting, a survey
- Lax Liftings and Lax Distributive Laws
- scientific article; zbMATH DE number 7577582 (Why is no real title available?)
- Preorder-constrained simulations for program refinement with effects
- Relating coalgebraic notions of bisimulation
- Simulations up-to and canonical preorders (extended abstract)
This page was built for publication: Simulations in coalgebra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q703522)
