Applications of Fair Testing

R. Gotzhein (Editor), Hendrik Brinksma, J. Bredereke (Editor), Arend Rensink, W. Vogler

    Research output: Contribution to conferencePaperpeer-review

    42 Downloads (Pure)

    Abstract

    In this paper we present the application of the fair testing pre-order, introduced in a previous paper, to the specification and analysis of distributed systems. This pre-order combines some features of the standard testing pre-orders, viz. the possibility to refine a specification by the resolution of nondeterminism, with a powerful feature of standard observation congruence, viz. the fair abstraction from divergences. Moreover, it is a pre-congruence with respect to all standard process-algebraic combinators, thus allowing for the standard algebraic proof techniques by substitution and rewriting. In this paper we will demonstrate advantages of the fair testing pre-order by the application to a number of examples, including a scheduling problem, a version of the Alternating Bit-protocol, and fair communication channels.
    Original languageUndefined
    Pages145-160
    Number of pages16
    Publication statusPublished - 1996
    EventProtocol Specification, Testing and Verification XVI (PSTV) -
    Duration: 1 Jan 19961 Jan 1996

    Conference

    ConferenceProtocol Specification, Testing and Verification XVI (PSTV)
    Period1/01/961/01/96

    Cite this