Characterising Testing Preorders for Finite Probabilistic Processes
Citation:
Yuxin Deng and Rob van Glabbeek and Matthew Hennessy and Carroll Morgan and Chenyi Zhang., Characterising Testing Preorders for Finite Probabilistic Processes, Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science, 22nd Annual IEEE Symposium on Logic in Computer Science, IEEE Computer Society, 171, 2007, 313-325Download Item:
04276575.pdf (publisher's pdf) 232.3Kb
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's Homepage:
http://people.tcd.ie/mcbhenneDescription:
PUBLISHED
Author: HENNESSY, MATTHEW
Other Titles:
Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science22nd Annual IEEE Symposium on Logic in Computer Science
Type of material:
Conference PaperSeries/Report no:
171Availability:
Full text availableKeywords:
Finite probabilistic processesDOI:
http://dx.doi.org/10.2168/lmcs-4(4:4)2008Licences: