Abstract
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.
Research partially support by the CYCIT project TIC 94-0851-C02-02.
Chapter PDF
References
G. Barret. The fixed point theory of unbounded non-determinism. Formal Aspects of Computing, 3:110–128, 1991.
M. Hennessy. Acceptance trees. Journal of the ACM, 32(4):896–928, 1985.
M. Hennessy. Algebraic Theory of Processes. MIT Press, 1988.
C.A.R. Hoare. Communicating Sequential Processes. Prentice Hall, 1985.
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.
A. W. Roscoe and G. Barret. Unbounded non-determinism in CSP. In Mathematical Foundations of Programming Semantics, LCNS 442, 1989.
A.W. Roscoe. Unbounded non-determinism in CSP. Journal of Logic and Computation, 3(2):131–172, 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Llana Díaz, L.F., Núñez, M. (1997). Testing semantics for unbounded nondeterminism. In: Lengauer, C., Griebl, M., Gorlatch, S. (eds) Euro-Par'97 Parallel Processing. Euro-Par 1997. Lecture Notes in Computer Science, vol 1300. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0002780
Download citation
DOI: https://doi.org/10.1007/BFb0002780
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63440-9
Online ISBN: 978-3-540-69549-3
eBook Packages: Springer Book Archive