Data refinement and singleton failures refinement are not equivalent

DOI10.1007/s00165-008-0076-5zbMath1149.68057OpenAlexW2019335535WikidataQ59651688 ScholiaQ59651688MaRDI QIDQ931436

Steve Reeves, David Streader

Publication date: 25 June 2008

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00165-008-0076-5

zbMATH Keywords

Data refinementSingleton failures refinement

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65)

Related Items (6)

Incompleteness of relational simulations in the blocking paradigm ⋮ Relational Concurrent Refinement: Automata ⋮ More Relational Concurrent Refinement: Traces and Partial Relations ⋮ Modelling Divergence in Relational Concurrent Refinement ⋮ Introducing extra operations in refinement ⋮ Relational concurrent refinement. III: Traces, partial relations and automata

Uses Software

• Z

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Relational concurrent refinement
• REFINE 2002. Proceedings of the BCS FACS refinement workshop (satellite event of FLoC 2002), Copenhagen, Denmark, July 20--21, 2002
• A singleton failures semantics for communicating sequential processes
• ZB 2005: Formal Specification and Development in Z and B

This page was built for publication: Data refinement and singleton failures refinement are not equivalent