Reward Testing Equivalences for Processes
Logic in Computer Science
2019-08-01 v1
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 equivalence.
Cite
@article{arxiv.1907.13348,
title = {Reward Testing Equivalences for Processes},
author = {Rob van Glabbeek},
journal= {arXiv preprint arXiv:1907.13348},
year = {2019}
}
Comments
This paper is dedicated to Rocco De Nicola, on the occasion of his 65th birthday. Rocco's work has been a source of inspiration to my own