Denotational semantics: a methodology for language development
Denotational semantics: a methodology for language development
Advances in Petri nets 1986, part II on Petri nets: applications and relationships to other models of concurrency
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
Nondeterministic data flow programs: how to avoid the merge anomaly
Science of Computer Programming
Theoretical Computer Science
A proof of the Kahn principle for input/output automata
Information and Computation
Connections between a concrete and an abstract model of concurrent systems
Proceedings of the fifth international conference on Mathematical foundations of programming semantics
Categorical combinators, sequential algorithms, and functional programming (2nd ed.)
Categorical combinators, sequential algorithms, and functional programming (2nd ed.)
Computations, Residuals, and the POwer of Indeterminancy
ICALP '88 Proceedings of the 15th International Colloquium on Automata, Languages and Programming
An Operational Semantics for Pure Dataflow
Proceedings of the 9th Colloquium on Automata, Languages and Programming
Scenarios: A Model of Non-Determinate Computation
Proceedings of the International Colloquium on Formalization of Programming Concepts
Compostional Relational Semantics for Indeterminate Dataflow Networks
Category Theory and Computer Science
On the Expressive Power of Indeterminate Network Primitives
On the Expressive Power of Indeterminate Network Primitives
HIERARCHICAL CORRECTNESS PROOFS FOR DISTRIBUTED ALGORITHMS
HIERARCHICAL CORRECTNESS PROOFS FOR DISTRIBUTED ALGORITHMS
Categories of asynchronous systems
Categories of asynchronous systems
Interaction nets with McCarthy's amb: properties and applications
Nordic Journal of Computing
| Hi-index | 0.00 |
We consider monotone input/output automata, which model a usefully large class of dataflow networks of indeterminate (or nonfunctional) processes. We obtain a characterization of the relations computable by these automata, which states that a relation R : X → 2Y (viewed as a “nondeterministic function”) is the input/output relation of an automaton iff there exists a certain kind of Scott domain D, a continuous function F : X → [D → Y] and a continuous function G : X → P(D), such that R(æ) = F(æ)†(G(æ)) for all inputs æ &egr; X. Here P denotes a certain powerdomain operator, and † denotes the pointwise extension to the powerdomain of a function on the underlying domain. An attractive feature of this result is that it specializes to two subclasses of automata, determinate automata, for which G is single-valued, and semi-determinate automata, for which G is a constant function. A corollary of the latter result is the impossibility of implementing “angelic merge” by a network of determinate processes and “infinity-fair merge” processes.