Characterising Testing Preorders for Finite Probabilistic Processes

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 cha...

Full description

Saved in:
Bibliographic Details
Published in:Logical methods in computer science 2008-10, Vol.4 (4)
Main Authors: Deng, Yuxin, van Glabbeek, Robert, Hennessy, Matthew, Morgan, Carroll
Format: Article
Language:English
Subjects:
computer science - logic in computer science
d.3.1
f.3.2
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1860-5974
1860-5974
DOI:10.2168/LMCS-4(4:4)2008