Logic in Computer Science, Symposium on (2007)
July 10, 2007 to July 14, 2007
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/LICS.2007.15
Yuxin Deng , Jiao tong University, China; University of New South Wales, Australia
Rob van Glabbeek , National ICT Australia; University of New South Wales, Australia
Matthew Hennessy , University of Sussex, UK
Carroll Morgan , University of New South Wales, Australia
Chenyi Zhang , National ICT Australia; University of New South Wales, Australia
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.
C. Zhang, Y. Deng, M. Hennessy, R. v. Glabbeek and C. Morgan, "Characterising Testing Preorders for Finite Probabilistic Processes," 2007 22nd Annual IEEE Symposium on Logic in Computer Science(LICS), Wroclaw, 2007, pp. 313-325.