Yuxin Deng ; Matthew Hennessy ; Rob van Glabbeek ; Carroll Morgan - Characterising Testing Preorders for Finite Probabilistic Processes

lmcs:694 - Logical Methods in Computer Science, October 28, 2008, Volume 4, Issue 4 - https://doi.org/10.2168/LMCS-4(4:4)2008
Characterising Testing Preorders for Finite Probabilistic Processes

Authors: Yuxin Deng ; Matthew Hennessy ; Rob van Glabbeek ; Carroll Morgan

    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.


    Volume: Volume 4, Issue 4
    Published on: October 28, 2008
    Accepted on: June 25, 2015
    Submitted on: February 7, 2008
    Keywords: Computer Science - Logic in Computer Science,F.3.2,D.3.1

    Linked data

    Source : ScholeXplorer IsReferencedBy DOI 10.1007/s00165-012-0236-5
    • 10.1007/s00165-012-0236-5
    • 10.1007/s00165-012-0236-5
    • 10.1007/s00165-012-0236-5
    Probabilistic may/must testing: retaining probabilities by restricted schedulers
    Georgievska, Sonja ; Andova, Suzana ;

    41 Documents citing this article

    Share

    Consultation statistics

    This page has been seen 543 times.
    This article's PDF has been downloaded 202 times.