Reward Testing Equivalences for Processes

Research output: Chapter in Book/Report/Conference proceedingChapter (peer-reviewed)peer-review

Abstract / Description of output

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.
Original languageEnglish
Title of host publicationModels, Languages, and Tools for Concurrent and Distributed Programming: Essays Dedicated to Rocco De Nicola on the Occasion of His 65th Birthday
EditorsMichele Boreale, Flavio Corradini, Michele Loreti, Rosario Pugliese
Place of PublicationCham
PublisherSpringer International Publishing Switzerland
Pages45-70
Number of pages26
ISBN (Electronic)978-3-030-21485-2
ISBN (Print)978-3-030-21484-5
DOIs
Publication statusPublished - 3 Jul 2019

Publication series

NameLecture Notes in Computer Science
PublisherSpringer Cham
Volume11665
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Keywords / Materials (for Non-textual outputs)

  • Reward testing
  • Semantic equivalences
  • Conditional liveness properties
  • Labelled transition systems
  • Process algebra
  • CCS
  • Axiomatisations
  • Recursion
  • Congruence
  • Divergence

Fingerprint

Dive into the research topics of 'Reward Testing Equivalences for Processes'. Together they form a unique fingerprint.

Cite this