Simulations in coalgebra

DOI10.1016/J.TCS.2004.07.022zbMath1071.68077OpenAlexW2104717233MaRDI QIDQ703522

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

zbMATH Keywords

SimulationCoalgebraRelation lifting

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (29)

Non-strongly Stable Orders Also Define Interesting Simulation Relations ⋮ On bisimilarity in lambda calculi with continuous probabilistic choice ⋮ Relation lifting, a survey ⋮ A Characterisation of Expressivity for Coalgebraic Bisimulation and Simulation ⋮ Structural congruence for bialgebraic semantics ⋮ Weighted and branching bisimilarities from generalized open maps ⋮ Formalization of Data Flow Computing and a Coinductive Approach to Verifying Flowware Synthesis ⋮ A point-free perspective on lax extensions and predicate liftings ⋮ Lax Liftings and Lax Distributive Laws ⋮ A calculus for generic, QoS-aware component composition ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A general account of coinduction up-to ⋮ Bisimulation proof methods in a path-based specification language for polynomial coalgebras ⋮ Unnamed Item ⋮ Processes as formal power series: a coinductive approach to denotational semantics ⋮ Unnamed Item ⋮ Quantitative simulations by matrices ⋮ Unnamed Item ⋮ New Bisimulation Semantics for Distributed Systems ⋮ Preorder-constrained simulations for program refinement with effects ⋮ (Bi)simulations up-to characterise process semantics ⋮ Extending set functors to generalised metric spaces ⋮ Probabilistic mediator: a coalgebraic perspective ⋮ Distributive laws for monotone specifications ⋮ Lax extensions of coalgebra functors and their logic ⋮ Relational presheaves, change of base and weak simulation ⋮ Corecursion up-to via causal transformations ⋮ Simulations Up-to and Canonical Preorders

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Structural induction and coinduction in a fibrational setting
• A co-induction principle for recursively defined domains
• Fixpoint semantics and simulation
• Universal coalgebra: A theory of systems
• Forward and backward simulations. I. Untimed Systems
• A coinduction principle for recursive data types based on bisimulation
• The Category-Theoretic Solution of Recursive Domain Equations
• The temporal logic of coalgebras via Galois algebras
• Final Coalgebras are Ideal Completions of Initial Algebras
• Coalgebraic theories of sequences in PVS
• A coalgebraic presentation of structured transition systems

This page was built for publication: Simulations in coalgebra