Relational concurrent refinement

DOI10.1007/s00165-003-0007-4zbMath1093.68061MaRDI 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

Simulation; Z; Process algebra; Refinement; Failures-divergences; Finalisation; Readiness

Mathematics Subject Classification ID

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

Related Items

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