Characterising Testing Preorders for Finite Probabilistic Processes

Yuxin Deng, Rob van Glabbeek, Matthew Hennessy, Carroll Morgan, Chenyi Zhang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract / Description of output

In 1992 Wang & Larsen extended the may- and must preorders of De Nicola and Hennessy to processes featuring probabilistic as well as nondeterministic choice. They concluded with two problems that have remained open throughout the years, namely to find complete axiomatisations and alternative characterisations for these preorders. This paper solves both problems for finite processes with silent moves. It characterises the may preorder in terms of simulation, and the must preorder in terms of failure simulation. It also gives a characterisation of both preorders using a modal logic. Finally it axiomatises both preorders over a probabilistic version of CSP.
Original languageEnglish
Title of host publication2007 22nd Annual IEEE Symposium on Logic in Computer Science
Place of PublicationLos Alamitos, CA, USA
PublisherIEEE Computer Society
Pages313-325
Number of pages13
ISBN (Print)978-0-7695-2908-0, 0-7695-2908-9
DOIs
Publication statusPublished - 14 Jul 2007
EventThe 22nd Annual IEEE Symposium on Logic in Computer Science, 2007 - Wroclaw, Poland
Duration: 10 Jul 200714 Jul 2007
Conference number: 22

Publication series

NameProceedings of the Annual IEEE Symposium on Logic in Computer Science
PublisherIEEE
ISSN (Print)1043-6871

Symposium

SymposiumThe 22nd Annual IEEE Symposium on Logic in Computer Science, 2007
Abbreviated titleLICS 2007
Country/TerritoryPoland
CityWroclaw
Period10/07/0714/07/07

Keywords / Materials (for Non-textual outputs)

  • testing
  • logic
  • calculus
  • informatics
  • computer science
  • australia council

Fingerprint

Dive into the research topics of 'Characterising Testing Preorders for Finite Probabilistic Processes'. Together they form a unique fingerprint.

Cite this