Characterising Testing Preorders for Finite Probabilistic Processes

Select |




Print


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

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


2007-07-10


Conference Material


22nd Annual IEEE Symposium on Logic in Computer Science, LICS 2007


Wroclaw, Poland


313-322


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.


IEEE Computer Society Press


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


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


978-0-7695-2908-0


nicta:150


Deng, Yuxin; van Glabbeek, Robert; Hennessy, Matthew; Morgan, Carroll; Zhang, Cuicui. Characterising Testing Preorders for Finite Probabilistic Processes. In: 22nd Annual IEEE Symposium on Logic in Computer Science, LICS 2007; Wroclaw, Poland. IEEE Computer Society Press; 2007-07-10. 313-322.



Loading citation data...

Citation counts
(Requires subscription to view)