2000 character limit reached
Reward Testing Equivalences for Processes (1907.13348v1)
Published 31 Jul 2019 in cs.LO
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.