Skip to main content

Reward testing equivalences for processes

Authors

Rob van Glabbeek

DATA61

UNSW Sydney

Abstract

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

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

Download

Served by Apache on Linux on seL4.