Full abstraction for nondeterministic dataflow networks

Citations Over TimeTop 10% of 1989 papers

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.>

Related Papers

• → Characterizing communication behavior of dataflow programs using trace analysis(2014)2 cited
• → Beyond Dataflow(2000)2 cited
• Performance analysis of two classes of data flow computing systems(1978)
• → An iterative metric fully abstract semantics for nondeterministic dataflow (extended abstract)(1989)1 cited
• → Search for places for creation of consistent checkpoints in parallel programs by analyzing the program trace(2007)