On CSP refinement tests that run multiple copies of a process
type: Item
instance of: scholarly article
zbMATH Open document ID: 1339.68169
author: Gavin Lowe
published in: Electronic Notes in Theoretical Computer Science
publication date: 2016-06-06T00:00:00Z
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 68Q85
zbMATH DE Number: 6589714
zbMATH Keywords: CSP
zbMATH Keywords: stable failures refinement checks
zbMATH Keywords: expressiveness
zbMATH Keywords: testing harnesses
MaRDI profile type: Publication
full work available at URL: j.entcs.2009.08.011
OpenAlex ID: W2136959787
cites work: Q4798029
cites work: Q3777424
cites work: Checking noninterference in timed CSP
cites work: On the expressive power of CSP refinement
cites work: Responsiveness of interoperating components
DOI: 10.1016/J.ENTCS.2009.08.011
Recommended article: Q4728225
Recommended article: Concurrent testing of processes
Recommended article: On the limits of refinement-testing for model-checking CSP
Recommended article: Testing using CSP Models: Time, Inputs, and Outputs
Recommended article: Testing equivalences for processes
title: On CSP refinement tests that run multiple copies of a process
description: scientific article; zbMATH DE number 6589714