Deng, Yuxin and Hennessy, Matthew and van Glabbeek, Rob and Morgan, Carroll - Characterising Testing Preorders for Finite Probabilistic Processes

lmcs:694 - Logical Methods in Computer Science, October 28, 2008, Volume 4, Issue 4
Characterising Testing Preorders for Finite Probabilistic Processes

Authors: Deng, Yuxin and Hennessy, Matthew and van Glabbeek, Rob and Morgan, Carroll

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.


Source : oai:arXiv.org:0810.3708
DOI : 10.2168/LMCS-4(4:4)2008
Volume: Volume 4, Issue 4
Published on: October 28, 2008
Submitted on: June 25, 2015
Keywords: Computer Science - Logic in Computer Science,F.3.2,D.3.1


Share

Browsing statistics

This page has been seen 36 times.
This article's PDF has been downloaded 6 times.