A single complete relational rule for coalgebraic refinement
DOI10.1016/J.ENTCS.2009.12.014zbMATH Open1342.68241OpenAlexW2137477976MaRDI QIDQ2994487FDOQ2994487
Authors: César J. Rodrigues, J. N. Oliveira, L. S. 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
Recommendations
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Categories of machines, automata (18B20)
Cites Work
- The coalgebraic class specification language CCSL
- Universal coalgebra: A theory of systems
- Title not available (Why is that?)
- A calculus of communicating systems
- Coalgebraic logic
- Title not available (Why is that?)
- Transposing partial components--an exercise on coalgebraic refinement
- An approach to object semantics based on terminal co-algebras
- Title not available (Why is that?)
- Title not available (Why is that?)
- Components as coalgebras: the refinement dimension
- A single complete rule for data refinement
- On the foundations of final coalgebra semantics: non-well-founded sets, partial orders, metric spaces
- Title not available (Why is that?)
- Relational concurrent refinement
- Title not available (Why is that?)
- Unifying concurrent and relational refinement
- Safety of abstract interpretations for free, via logical relations and Galois connections
- Mathematics of Program Construction
- Title not available (Why is that?)
- Algebraic Methodology and Software Technology
- Title not available (Why is that?)
- Title not available (Why is that?)
- Object-oriented hybrid systems of coalgebras plus monoid actions
- Refinement and the Z schema calculus
Cited In (2)
Uses Software
This page was built for publication: A single complete relational rule for coalgebraic refinement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2994487)
