AbstractWe use input/output automata to define a simple and general model of networks of concurrently executing, nondeterministic processes that communicate through unidirectional, named ports. A notion of the input/output relation computed by a process is defined, and determinate processes are defined to be processes whose input/output relations are single-valued. We show that determinate processes compute continuous functions, and that networks of determinate processes obey Kahn's fixed-point principle. Although these results are already known, our contribution lies in the fact that the input/output automata model yields extremely simple proofs of them (the simplest we have seen), in spite of its generality
The theory of automata and formal language was devised in the 1930s to provide models for and to rea...
AbstractInput/output automata are a widely used formalism for the specification and verification of ...
AbstractConcurrent transition systems (CTS's), are ordinary nondeterministic transition systems that...
AbstractWe use input/output automata to define a simple and general model of networks of concurrentl...
textabstractWe consider dynamic Kahn-like data flow networks, i.e. networks consisting of determinis...
AbstractThe (first part of the) Kahn principle states that networks with deterministic nodes are det...
The class of monotone input/output automata has been shown in the authors' previous work to be a us...
Almost ten years ago, Gilles Kahn used the fixed point theory of Dana Scott to define a formal and e...
AbstractWe model a process—the unit of concurrent processing—as a port automaton, a certain type of ...
We investigate the power of Kahn-style dataflow networks, with processes that may exhibit indetermi...
Kahn and MacQueen have introduced a generic class of determinate asynchronous data-flow applications...
Deterministic asynchronous concurrent formalisms are valuable because determinism greatly simplifies...
Kahn andMacQueen have introduced a generic class of determinate asynchronous data-flow applications,...
Anyone who has studied parallel programming with Kahn's networks of processes and also systems ...
In this paper we investigate generalizations of Kahn's principle to nondeterministic dataflow networ...
The theory of automata and formal language was devised in the 1930s to provide models for and to rea...
AbstractInput/output automata are a widely used formalism for the specification and verification of ...
AbstractConcurrent transition systems (CTS's), are ordinary nondeterministic transition systems that...
AbstractWe use input/output automata to define a simple and general model of networks of concurrentl...
textabstractWe consider dynamic Kahn-like data flow networks, i.e. networks consisting of determinis...
AbstractThe (first part of the) Kahn principle states that networks with deterministic nodes are det...
The class of monotone input/output automata has been shown in the authors' previous work to be a us...
Almost ten years ago, Gilles Kahn used the fixed point theory of Dana Scott to define a formal and e...
AbstractWe model a process—the unit of concurrent processing—as a port automaton, a certain type of ...
We investigate the power of Kahn-style dataflow networks, with processes that may exhibit indetermi...
Kahn and MacQueen have introduced a generic class of determinate asynchronous data-flow applications...
Deterministic asynchronous concurrent formalisms are valuable because determinism greatly simplifies...
Kahn andMacQueen have introduced a generic class of determinate asynchronous data-flow applications,...
Anyone who has studied parallel programming with Kahn's networks of processes and also systems ...
In this paper we investigate generalizations of Kahn's principle to nondeterministic dataflow networ...
The theory of automata and formal language was devised in the 1930s to provide models for and to rea...
AbstractInput/output automata are a widely used formalism for the specification and verification of ...
AbstractConcurrent transition systems (CTS's), are ordinary nondeterministic transition systems that...