Inputs and Outputs in CSP

DOI10.1145/3379508MaRDI QIDQ5121275zbMATH OpenOpenAlexFDO

Authors Ana Cavalcanti, Sidney Nogueira, Robert M. Hierons

Publication date 11 September 2020

Published in ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3379508

zbMATH Keywords

exhaustive test setprocess algebrarefinementrefusal-testing model

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Testing using CSP Models: Time, Inputs, and Outputs
• On the limits of refinement-testing for model-checking CSP
• scientific article; zbMATH DE number 4003498
• Testing the Complexity of a Valued CSP Language
• Abstraction and testing in CSP
• Model checking CSP based on ASP and critical-trace model of CSP

Cited in

(6)

• Removing redundant refusals: minimal complete test suites for failure trace semantics
• scientific article; zbMATH DE number 2013781 (Why is no real title available?)
• Testing using CSP Models: Time, Inputs, and Outputs
• Combining sequential test cases into an equivalent set of adaptive test cases
• The best of both worlds: model-driven engineering meets model-based testing
• Reactive model-based testing of cyclic systems

This page was built for publication: Inputs and Outputs in CSP

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