Characterising Testing Preorders for Finite Probabilistic Processes

Select |




Print


Deng, Yuxin; van Glabbeek, Robert; Hennessy, Matthew; Morgan, Carroll

Deng, Yuxin; van Glabbeek, Robert; Hennessy, Matthew; Morgan, Carroll


2008-10-28


Journal Article


Logical Methods in Computer Science


4


4


1-33


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.


Probabilistic processes, nondeterminism, CSP, transition systems, testing equivalences, simulation, failure simulation, modal characterisations, complete axiomatisations.


http://www.cse.unsw.edu.au/~rvg/pub/finprobtesting.pdf


1860-5974


nicta:154


Deng, Yuxin; van Glabbeek, Robert; Hennessy, Matthew; Morgan, Carroll. Characterising Testing Preorders for Finite Probabilistic Processes. Logical Methods in Computer Science. 2008-10-28; 4(4):1-33.



Loading citation data...

Citation counts
(Requires subscription to view)