Title :
Full abstraction for nondeterministic dataflow networks
Author :
Russell, James R.
Author_Institution :
Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA
fDate :
30 Oct-1 Nov 1989
Abstract :
The problem of finding fully abstract semantic models for nondeterministic dataflow networks is discussed. The author presents a result indicating that there exist nondeterministic networks using only bounded choice for which the input-output relation is not compositional. It is shown that the trace semantics is fully abstract for all nondeterministic as well as deterministic networks
Keywords :
computer networks; data structures; bounded choice; full abstraction; input-output relation; nondeterministic dataflow networks; semantic models; Computer networks; Computer science; Concurrent computing; Context modeling; H infinity control;
Conference_Titel :
Foundations of Computer Science, 1989., 30th Annual Symposium on
Conference_Location :
Research Triangle Park, NC
Print_ISBN :
0-8186-1982-1
DOI :
10.1109/SFCS.1989.63474
