Simulations in coalgebra
From MaRDI portal
Publication:703522
DOI10.1016/J.TCS.2004.07.022zbMATH Open1071.68077OpenAlexW2104717233MaRDI QIDQ703522FDOQ703522
Authors: Jesse Hughes, Bart Jacobs
Publication date: 11 January 2005
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2004.07.022
Recommendations
Cites Work
- Structural induction and coinduction in a fibrational setting
- Universal coalgebra: A theory of systems
- Forward and backward simulations. I. Untimed Systems
- The Category-Theoretic Solution of Recursive Domain Equations
- Title not available (Why is that?)
- The lambda calculus. Its syntax and semantics. Rev. ed.
- Fixpoint semantics and simulation
- Simulations in coalgebra
- Title not available (Why is that?)
- Title not available (Why is that?)
- Final Coalgebras are Ideal Completions of Initial Algebras
- A coalgebraic presentation of structured transition systems
- A co-induction principle for recursively defined domains
- A coinduction principle for recursive data types based on bisimulation
- The temporal logic of coalgebras via Galois algebras
- Title not available (Why is that?)
- Title not available (Why is that?)
- Coalgebraic theories of sequences in PVS
- Title not available (Why is that?)
Cited In (38)
- Title not available (Why is that?)
- Corecursion up-to via causal transformations
- Reflection and Preservation of Properties in Coalgebraic (bi)Simulations
- Title not available (Why is that?)
- A point-free perspective on lax extensions and predicate liftings
- (Bi)simulations up-to characterise process semantics
- Transitivity and difunctionality of bisimulations
- Title not available (Why is that?)
- Probabilistic mediator: a coalgebraic perspective
- Weighted and branching bisimilarities from generalized open maps
- Simulations in coalgebra
- Relation lifting, a survey
- On bisimilarity in lambda calculi with continuous probabilistic choice
- Quantitative simulations by matrices
- Coalgebraic simulations and congruences
- Formalization of Data Flow Computing and a Coinductive Approach to Verifying Flowware Synthesis
- A calculus for generic, QoS-aware component composition
- Lax Liftings and Lax Distributive Laws
- Preorders on monads and coalgebraic simulations
- Structural congruence for bialgebraic semantics
- Distributive laws for monotone specifications
- Distributive laws for monotone specifications
- Processes as formal power series: a coinductive approach to denotational semantics
- Similarity quotients as final coalgebras
- Simulations up-to and canonical preorders (extended abstract)
- Bisimulation proof methods in a path-based specification language for polynomial coalgebras
- Relating coalgebraic notions of bisimulation
- Title not available (Why is that?)
- A Characterisation of Expressivity for Coalgebraic Bisimulation and Simulation
- Non-strongly stable orders also define interesting simulation relations
- Title not available (Why is that?)
- Lax extensions of coalgebra functors and their logic
- A single complete relational rule for coalgebraic refinement
- Extending set functors to generalised metric spaces
- Preorder-constrained simulations for program refinement with effects
- Relational presheaves, change of base and weak simulation
- A general account of coinduction up-to
- New Bisimulation Semantics for Distributed Systems
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)