Incompleteness of relational simulations in the blocking paradigm

DOI10.1016/j.scico.2010.07.003zbMath1209.68306OpenAlexW2142852925MaRDI QIDQ608349

John Derrick, Eerke A. Boiten

Publication date: 25 November 2010

Published in: Science of Computer Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.scico.2010.07.003

zbMATH Keywords

downward and upward simulationsfailures refinementjoint completenessrelational refinement

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Semantics in the theory of computing (68Q55)

Related Items

Guarded Operations, Refinement and Simulation, 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

• Contexts, refinement and determinism
• Prespecification in data refinement
• Relational concurrent refinement
• An analysis of refinement in an abortive paradigm
• Process simulation and refinement
• Data refinement and singleton failures refinement are not equivalent
• Relational concurrent refinement. II: Internal operations and outputs
• A state-based approach to communicating processes
• Forward and backward simulations. I. Untimed Systems
• Data Refinement
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item