Data refinement and singleton failures refinement are not equivalent
From MaRDI portal
Recommendations
- A single complete rule for data refinement
- Some proofs of data refinement
- Refining imprecise data by integrity constraints
- Data Refinement
- Data refinement in Isabelle/HOL
- scientific article; zbMATH DE number 2080318
- Data refinement of mixed specifications: A generalization of UNITY
- Unification: A case-study in data refinement
- Verifying data refinements using a model checker
Cites work
- scientific article; zbMATH DE number 1615985 (Why is no real title available?)
- scientific article; zbMATH DE number 605917 (Why is no real title available?)
- A comparison of refinement orderings and their associated simulation rules
- A singleton failures semantics for communicating sequential processes
- REFINE 2002. Proceedings of the BCS FACS refinement workshop (satellite event of FLoC 2002), Copenhagen, Denmark, July 20--21, 2002
- Relational concurrent refinement
- ZB 2005: Formal Specification and Development in Z and B
Cited in
(6)- Modelling Divergence in Relational Concurrent Refinement
- Introducing extra operations in refinement
- Relational concurrent refinement. III: Traces, partial relations and automata
- Incompleteness of relational simulations in the blocking paradigm
- Relational concurrent refinement: automata
- More relational concurrent refinement: traces and partial relations
This page was built for publication: Data refinement and singleton failures refinement are not equivalent
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q931436)
