Lics

IEEE Symposium on Logic in Computer Science

LICS Home - LICS Awards - LICS Newsletters - LICS Archive - LICS Organization - Logic-Related Conferences - Links

Twenty-Second Annual IEEE Symposium on

Logic in Computer Science (LICS 2007)

Paper: Characterising Testing Preorders for Finite Probabilistic Processes (at LICS 2007)

Authors: Yuxin Deng Rob J. van Glabbeek Matthew Hennessy Carroll Morgan Chenyi Zhang

Abstract

In 1992 Wang and 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.

BibTeX

  @InProceedings{DengvanGlabbeekHenn-CharacterisingTesti,
    author = 	 {Yuxin Deng and Rob J. van Glabbeek and Matthew Hennessy and Carroll Morgan and Chenyi Zhang},
    title = 	 {Characterising Testing Preorders for Finite Probabilistic Processes},
    booktitle =  {Proceedings of the Twenty-Second Annual IEEE Symposium on Logic in Computer Science (LICS 2007)},
    year =	 {2007},
    month =	 {July}, 
    pages =      {313--322},
    location =   {Wroclaw, Poland}, 
    publisher =	 {IEEE Computer Society Press}
  }
   

Last modified: 2017-04-0512:37
Andrzej Murawski