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

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)

Recommendations

• An exercise on transition systems
• scientific article; zbMATH DE number 1617299
• Coalgebras for fuzzy transition systems
• Relating coalgebraic notions of bisimulation
• Simulations in coalgebra

Cites work

• scientific article; zbMATH DE number 1231631 (Why is no real title available?)
• scientific article; zbMATH DE number 1304993 (Why is no real title available?)
• scientific article; zbMATH DE number 1314225 (Why is no real title available?)
• scientific article; zbMATH DE number 977284 (Why is no real title available?)
• scientific article; zbMATH DE number 1064116 (Why is no real title available?)
• scientific article; zbMATH DE number 1487738 (Why is no real title available?)
• scientific article; zbMATH DE number 2172972 (Why is no real title available?)
• scientific article; zbMATH DE number 2087345 (Why is no real title available?)
• scientific article; zbMATH DE number 1569136 (Why is no real title available?)
• A calculus of communicating systems
• A single complete rule for data refinement
• Algebraic Methodology and Software Technology
• An approach to object semantics based on terminal co-algebras
• Coalgebraic logic
• Components as coalgebras: the refinement dimension
• Mathematics of Program Construction
• Object-oriented hybrid systems of coalgebras plus monoid actions
• On the foundations of final coalgebra semantics: non-well-founded sets, partial orders, metric spaces
• Refinement and the Z schema calculus
• Relational concurrent refinement
• Safety of abstract interpretations for free, via logical relations and Galois connections
• The coalgebraic class specification language CCSL
• Transposing partial components--an exercise on coalgebraic refinement
• Unifying concurrent and relational refinement
• Universal coalgebra: A theory of systems

Cited in

(2)

• Probabilistic mediator: a coalgebraic perspective
• Transposing partial components--an exercise on coalgebraic refinement

Describes a project that uses

Uses Software

• CCSL

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)