Characterising Testing Preorders for Finite Probabilistic Processes

Authors:
Yuxin Deng;Rob van Glabbeek;Matthew Hennessy;Carroll Morgan;Chenyi Zhang
Affiliations:
Jiao tong University, China/ University of New South Wales, Australia;National ICT Australia/ University of New South Wales, Australia;University of Sussex, UK;University of New South Wales, Australia;National ICT Australia/ University of New South Wales, Australia
Venue:
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
Year:
2007

Citing 0
Cited 10

A testing scenario for probabilistic processes

Journal of the ACM (JACM)
A Hierarchy of Equivalences for Probabilistic Processes

FORTE '08 Proceedings of the 28th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Rate-Based Transition Systems for Stochastic Process Calculi

ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
MarCaSPiS: a Markovian Extension of a Calculus for Services

Electronic Notes in Theoretical Computer Science (ENTCS)
Uniform Logical Characterizations of Testing Equivalences for Nondeterministic, Probabilistic and Markovian Processes

Electronic Notes in Theoretical Computer Science (ENTCS)
The Kantorovich Metric in Computer Science: A Brief Survey

Electronic Notes in Theoretical Computer Science (ENTCS)
On a Uniform Framework for the Definition of Stochastic Process Languages

FMICS '09 Proceedings of the 14th International Workshop on Formal Methods for Industrial Critical Systems
Probabilistic Logical Characterization

Information and Computation
Testing probabilistic distributed systems

FMOODS'10/FORTE'10 Proceedings of the 12th IFIP WG 6.1 international conference and 30th IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems
A uniform definition of stochastic process calculi

ACM Computing Surveys (CSUR)

Quantified Score

Hi-index	0.00

Visualization

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.