Skip to main content
SpringerLink
Log in

Abstraction and Testing in CSP

  • Original Paper
  • Published:
Formal Aspects of Computing

Abstract.

Restricted views of process behaviour result in a form of abstraction which is useful in the construction of specifications involving fault-tolerance and atomicity. This paper presents an operational characterisation of abstraction for refusable and non-refusable events in terms of testing. This view is a generalisation of standard notions of testing, and is given a new denotational characterisation encapsulated within the CSP denotational semantics. It informs, reinforces and extends the traditional denotational approach to abstraction.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Department of Computer Science, Royal Holloway University of London, Egham, UK, , , , , , GB

    Steve Schneider

Authors
  1. Steve Schneider
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received February 2000 / Accepted in revised form April 2000

Rights and permissions

Reprints and permissions

About this article

Cite this article

Schneider, S. Abstraction and Testing in CSP. Form Aspects Comput 12, 165–181 (2000). https://doi.org/10.1007/s001650070027

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s001650070027

Search

Navigation