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