Characterising Testing Preorders for Finite Probabilistic Processes

Details Characterising Testing Preorders for Finite Probabilistic Processes Characterising Testing Preorders for Finite Probabilistic Processes

2008-10-21

arxiv.org/abs/0810.3708v2

LMCS 4 (4:4) 2008

Computer Science

Logic in Computer Science

33 pages

Scientific paper

10.2168/LMCS-4(4:4)2008

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.

Affiliated with

Also associated with

No associations

Rating

Characterising Testing Preorders for Finite Probabilistic Processes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Characterising Testing Preorders for Finite Probabilistic Processes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Characterising Testing Preorders for Finite Probabilistic Processes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-572384