Reward testing equivalences for processes

DOI10.1007/978-3-030-21485-2_5MaRDI QIDQ6199102zbMATH OpenOpenAlexFDO

Authors Rob van Glabbeek

Publication date 23 February 2024

Published in Models, Languages, and Tools for Concurrent and Distributed Programming (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1907.13348

zbMATH Keywords

axiomatisationCCSconditional liveness propertiescongruencelabelled transition systemsprocess algebrarecursionreward testingsemantic equivalences

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

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.

Recommendations

• On real reward testing
• Real-reward testing for probabilistic processes (extended abstract)
• Real-reward testing for probabilistic processes
• Testing equivalences for processes
• Remarks on testing probabilistic processes

Cited in

(1)

• Testing equivalence vs. runtime monitoring

This page was built for publication: Reward testing equivalences for processes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6199102)