A simple language of finite probabilistic processes is presented. Its formalsyntax and interleaving semantics are provided. The relation between the language and a subset of LOTOS is discussed, and it is proven to be testing equivalence. Finally some examples are given.
展开▼