@inproceedings{c934dc31b90d41ff8254a4d5aafb5d5d,
title = "Characterising testing preorders for finite probabilistic processes",
abstract = "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.",
author = "Yuxin Deng and \{Van Glabbeek\}, Rob and Matthew Hennessy and Carroll Morgan and Chenyi Zhang",
year = "2007",
doi = "10.1109/LICS.2007.15",
language = "英语",
isbn = "0769529089",
series = "Proceedings - Symposium on Logic in Computer Science",
pages = "313--322",
booktitle = "Proceedings - 22nd Annual IEEE Symposiumon Logic in Computer Science, LICS 2007",
note = "22nd Annual IEEE Symposium on Logic in Computer Science, LICS 2007 ; Conference date: 10-07-2007 Through 14-07-2007",
}