A mathematical approach to nondeterminism in data types
- 1 January 1988
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Programming Languages and Systems
- Vol. 10 (1) , 87-117
- https://doi.org/10.1145/42192.42194
Abstract
The theory of abstract data types is generalized to the case of nondeterministic operations (set-valuedfunctions). Since the nondeterminism of operations may be coupled, signatures are extended so that operations can have results in Cartesian products. Input/output behavior is used to characterize implementation of one model by another. It is described by means of accumulated arrows, which form a generalization of the term algebra. Morphisms of nondeterministic models are introduced. Both innovations prove to be powerful tools in the analysis of input/output behavior. Extraction equivalence and observable equivalence of values are investigated. Quotient models for such equivalence relations are constructed. The equivalence relations are compared with each other, with separation of values by means of experiments, and with the separation property that characterizes a terminal model. Examples are given to show that the four concepts are different. In deterministic models the concepts coincide.Keywords
This publication has 4 references indexed in Scilit:
- A subdirect decomposition theorem for multialgebrasAlgebra universalis, 1983
- A kernel language for algebraic specification and implementation extended abstractPublished by Springer Nature ,1983
- Nondeterminism in abstract data typesPublished by Springer Nature ,1981
- Homomorphisms and subalgebras of multialgebrasPacific Journal of Mathematics, 1967