Abstraction and testing in CSP

DOI10.1007/S001650070027MaRDI QIDQ5926769zbMATH OpenOpenAlexFDO

Authors S. A. Schneider

Publication date 7 March 2001

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

Full work available at URL https://doi.org/10.1007/s001650070027

zbMATH Keywords

CSP denotational semanticsoperational semanticsprocess algebra

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• scientific article; zbMATH DE number 1487484
• scientific article; zbMATH DE number 1735620
• Refusal testing
• scientific article; zbMATH DE number 3956420
• Counter abstraction in the CSP/FDR setting

Cited in

(8)

• Test-design through abstraction: A systematic approach based on the refinement calculus
• Slow abstraction via priority
• scientific article; zbMATH DE number 1735620 (Why is no real title available?)
• scientific article; zbMATH DE number 1487484 (Why is no real title available?)
• scientific article; zbMATH DE number 1759711 (Why is no real title available?)
• scientific article; zbMATH DE number 4003498 (Why is no real title available?)
• Inputs and Outputs in CSP
• Testing using CSP Models: Time, Inputs, and Outputs

This page was built for publication: Abstraction and testing in CSP

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5926769)