期刊
LOGICAL METHODS IN COMPUTER SCIENCE
卷 4, 期 4, 页码 -出版社
LOGICAL METHODS COMPUTER SCIENCE E V
DOI: 10.2168/LMCS-4(4:4)2008
关键词
Probabilistic processes; testing semantics; simulation; axiomatisation
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 finite CSP.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据