Modeling concurrency with partial orders
International Journal of Parallel Programming
Concurrent transition system semantics of process networks
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Theoretical Computer Science
A fully abstract trace model for dataflow networks
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Computations, Residuals, and the POwer of Indeterminancy
ICALP '88 Proceedings of the 15th International Colloquium on Automata, Languages and Programming
Scenarios: A Model of Non-Determinate Computation
Proceedings of the International Colloquium on Formalization of Programming Concepts
Semantics of Networks Containing Indeterminate Operators
Seminar on Concurrency, Carnegie-Mellon University
Abstract Interpretation and Indeterminacy
Seminar on Concurrency, Carnegie-Mellon University
Nets of processes and data flow
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
On the Expressive Power of Indeterminate Network Primitives
On the Expressive Power of Indeterminate Network Primitives
CASCON '92 Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 2
A fully abstract trace model for dataflow and asynchronous networks
Distributed Computing
| Hi-index | 0.00 |
In this paper we investigate generalizations of Kahn's principle to nondeterministic dataflow networks. Specifically, we show that for the class of “oraclizable” networks a semantic model in which networks are represented by certain sets of continuous functions is fully abstract and has the fixed-point property. We go on to show that the oraclizable networks are the largest class representable by this model, and are a proper superclass of the networks implementable with the infinity fair merge primitive. Finally, we use this characterization to show that infinity fair merge networks and oraclizable networks are proper subclasses of the networks with Egli-Milner monotone input-output relations.