Applications of Fair Testing

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

    Research output: Contribution to conferencePaperAcademicpeer-review

    23 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

    Cite this

    Gotzhein, R. (Ed.), Brinksma, H., Bredereke, J. (Ed.), Rensink, A., & Vogler, W. (1996). Applications of Fair Testing. 145-160.
    Gotzhein, R. (Editor) ; Brinksma, Hendrik ; Bredereke, J. (Editor) ; Rensink, Arend ; Vogler, W. / Applications of Fair Testing. 16 p.
    @conference{c9099ee5df23419782bebb5683f454be,
    title = "Applications of Fair Testing",
    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.",
    author = "R. Gotzhein and Hendrik Brinksma and J. Bredereke and Arend Rensink and W. Vogler",
    year = "1996",
    language = "Undefined",
    pages = "145--160",

    }

    Gotzhein, R (ed.), Brinksma, H, Bredereke, J (ed.), Rensink, A & Vogler, W 1996, 'Applications of Fair Testing' pp. 145-160.

    Applications of Fair Testing. / Gotzhein, R. (Editor); Brinksma, Hendrik; Bredereke, J. (Editor); Rensink, Arend; Vogler, W.

    1996. 145-160.

    Research output: Contribution to conferencePaperAcademicpeer-review

    TY - CONF

    T1 - Applications of Fair Testing

    AU - Brinksma, Hendrik

    AU - Rensink, Arend

    AU - Vogler, W.

    A2 - Gotzhein, R.

    A2 - Bredereke, J.

    PY - 1996

    Y1 - 1996

    N2 - 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.

    AB - 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.

    M3 - Paper

    SP - 145

    EP - 160

    ER -

    Gotzhein R, (ed.), Brinksma H, Bredereke J, (ed.), Rensink A, Vogler W. Applications of Fair Testing. 1996.