A Single Complete Relational Rule for Coalgebraic Refinement

DOI10.1016/j.entcs.2009.12.014zbMath1342.68241OpenAlexW2137477976MaRDI QIDQ2994487

César J. Rodrigues, José Nuno Oliveira, Luís Soares Barbosa

Publication date: 1 August 2016

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2009.12.014

zbMATH Keywords

transition systemscoalgebraic refinement

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Categories of machines, automata (18B20)

Related Items (1)

Probabilistic mediator: a coalgebraic perspective

Uses Software

• CCSL

Cites Work

• A single complete rule for data refinement
• Relational concurrent refinement
• Components as coalgebras: the refinement dimension
• Transposing partial components--an exercise on coalgebraic refinement
• A calculus of communicating systems
• Coalgebraic logic
• Object-oriented hybrid systems of coalgebras plus monoid actions
• Universal coalgebra: A theory of systems
• Safety of abstract interpretations for free, via logical relations and Galois connections
• On the foundations of final coalgebra semantics: non-well-founded sets, partial orders, metric spaces
• An approach to object semantics based on terminal co-algebras
• Algebraic Methodology and Software Technology
• Mathematics of Program Construction
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Single Complete Relational Rule for Coalgebraic Refinement