Relational concurrent refinement. III: Traces, partial relations and automata
type: Item
instance of: scholarly article
title: Relational concurrent refinement. III: Traces, partial relations and automata
zbMATH Open document ID: 1342.68227
author: John Derrick
author: Eerke Boiten
published in: Formal Aspects of Computing
publication date: 2016-08-05T00:00:00Z
Mathematics Subject Classification ID: 68Q85
Mathematics Subject Classification ID: 68N30
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q60
zbMATH DE Number: 6609548
zbMATH Keywords: data refinement
zbMATH Keywords: Z
zbMATH Keywords: simulations
zbMATH Keywords: automata-based refinements
zbMATH Keywords: concurrency
zbMATH Keywords: traces
zbMATH Keywords: completed
zbMATH Keywords: failures
zbMATH Keywords: failure traces
zbMATH Keywords: extension
describes a project that uses: LOTOS
describes a project that uses: Z
MaRDI profile type: Publication
full work available at URL: s00165-012-0262-3
OpenAlex ID: W2151604085
cites work: Q3569584
cites work: Unifying concurrent and relational refinement
cites work: Q4737562
cites work: A singleton failures semantics for communicating sequential processes
cites work: Modelling Divergence in Relational Concurrent Refinement
cites work: Incompleteness of relational simulations in the blocking paradigm
cites work: Relational concurrent refinement. II: Internal operations and outputs
cites work: Handbook of process algebra
cites work: Q2724177
cites work: Relational concurrent refinement
cites work: More Relational Concurrent Refinement: Traces and Partial Relations
cites work: Extensional equivalences for transition systems
cites work: Data Refinement
cites work: A process algebraic view of input/output automata
cites work: Proving Linearizability Via Non-atomic Refinement
cites work: Q4436964
cites work: ZB 2005: Formal Specification and Development in Z and B
cites work: Q3713577
cites work: Q3777424
cites work: A state-based approach to communicating processes
cites work: Q4028627
cites work: Q3833630
cites work: Forward and backward simulations. I. Untimed Systems
cites work: Q3992568
cites work: Data refinement and singleton failures refinement are not equivalent
cites work: Quiescence, fairness, testing, and the notion of implementation
cites work: The linear time -- branching time spectrum. I: The semantics of concrete, sequential processes.
cites work: Q4301167
DOI: 10.1007/S00165-012-0262-3
description: scientific article; zbMATH DE number 6609548