Relational concurrent refinement

DOI10.1007/s00165-003-0007-4zbMath1093.68061OpenAlexW2038167407MaRDI QIDQ706513

John Derrick, Eerke A. Boiten

Publication date: 8 February 2005

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

Full work available at URL: https://doi.org/10.1007/s00165-003-0007-4

zbMATH Keywords

SimulationZProcess algebraRefinementFailures-divergencesFinalisationReadiness

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (19)

Verifying data refinements using a model checker ⋮ On using data abstractions for model checking refinements ⋮ Incompleteness of relational simulations in the blocking paradigm ⋮ Temporal-logic property preservation under Z refinement ⋮ Data refinement and singleton failures refinement are not equivalent ⋮ A Single Complete Relational Rule for Coalgebraic Refinement ⋮ Relational Concurrent Refinement: Automata ⋮ More Relational Concurrent Refinement: Traces and Partial Relations ⋮ General Refinement, Part One: Interfaces, Determinism and Special Refinement ⋮ Integrating a formal method into a software engineering process with UML and Java ⋮ Contexts, refinement and determinism ⋮ Model transformations across views ⋮ Modelling Divergence in Relational Concurrent Refinement ⋮ The behavioural semantics of Event-B refinement ⋮ Relational concurrent refinement. III: Traces, partial relations and automata ⋮ Relational concurrent refinement. II: Internal operations and outputs ⋮ Trace-based derivation of a scalable lock-free stack algorithm ⋮ Understanding, Explaining, and Deriving Refinement ⋮ Generic Tools via General Refinement

This page was built for publication: Relational concurrent refinement