Skip to main content

Reward testing equivalences for processes


Rob van Glabbeek


UNSW Sydney


May and must testing were introduced by De Nicola and Hennessy to define semantic equivalences on processes. May-testing equivalence exactly captures safety properties, and must-testing equivalence liveness properties. This paper proposes reward testing and shows that the resulting semantic equivalence also captures conditional liveness properties. It is strictly finer than both the may- and must-testing equivalenc

BibTeX Entry

    author           = {van Glabbeek, Rob},
    doi              = {\_5},
    editor           = {{Michele Boreale, Flavio Corradini, Michele Loreti and Rosario Pugliese}},
    month            = jul,
    date             = {2019-7-3},
    year             = {2019},
    keywords         = {Reward testing; Semantic equivalences; Conditional liveness properties; Labelled transition systems;
                        Process algebra; {CCS}; Axiomatisations; Recursion; Congruence; Divergence.},
    title            = {Reward Testing Equivalences for Processes},
    series           = {Lecture Notes in Computer Science},
    address          = {Prague, Czech Republic},
    pages            = {45-70},
    volume           = {11665},
    booktitle        = {Models, Languages, and Tools for Concurrent and Distributed Programming, Essays Dedicated to Rocco
                        De Nicola on the Occasion of His 65th Birthday},
    paperurl         = {},
    publisher        = {Springer},
    isbn             = {9783030214852}