Trustworthy Systems

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

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