Testing semantics for unbounded nondeterminism
We present an extension of the classical testing semantics for the case when nondeterminism is unbounded. We define the corresponding may and must preorders in the new framework. As in the bounded setting the may preorder can be characterized by using the set of finite traces of processes. On the contrary, in order to characterize the must preorder is necessary to record some additional information about the infinite behavior of processes. This characterization will be an extension of acceptance sets, considering not only the finite traces a process can execute but also its infinite traces.
KeywordsProcess algebra CSP unbounded nondeterminism operational semantics testing semantics
Unable to display preview. Download preview PDF.
- [Bar91]G. Barret. The fixed point theory of unbounded non-determinism. Formal Aspects of Computing, 3:110–128, 1991.Google Scholar
- [Hen85]M. Hennessy. Acceptance trees. Journal of the ACM, 32(4):896–928, 1985.Google Scholar
- [Hen88]M. Hennessy. Algebraic Theory of Processes. MIT Press, 1988.Google Scholar
- [Hoa85]C.A.R. Hoare. Communicating Sequential Processes. Prentice Hall, 1985.Google Scholar
- [Mis95]M.W. Mislove. Denotational models for unbounded nondeterminism. In Proceedings of 11th Mathematical Foundations of Programming Semantics. Electronic Notes in Theoretical Computer Science 1, 1995.Google Scholar
- [RB89]A. W. Roscoe and G. Barret. Unbounded non-determinism in CSP. In Mathematical Foundations of Programming Semantics, LCNS 442, 1989.Google Scholar
- [Ros93]A.W. Roscoe. Unbounded non-determinism in CSP. Journal of Logic and Computation, 3(2):131–172, 1993.Google Scholar