A fixpoint semantics for nondeterministic data flow
Journal of the ACM (JACM)
Denotational semantics of nets with nondeterminism
Proc. of the European symposium on programming on ESOP 86
Minimal and Optimal Computations of Recursive Programs
Journal of the ACM (JACM)
Communicating sequential processes
Communications of the ACM
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Algebraic Semantics
Automata, Languages, and Machines
Automata, Languages, and Machines
On the composition of processes
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An Operational Semantics for Pure Dataflow
Proceedings of the 9th Colloquium on Automata, Languages and Programming
Behavioural Equivalence Relations Induced by Programming Logics
Proceedings of the 10th 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
Categories of Models for Concurrency
Seminar on Concurrency, Carnegie-Mellon University
A refinement of Kahn's semantics to handle non-determinism and communication (Extended Abstract)
PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Recursive definitions of partial functions and their computations
Recursive definitions of partial functions and their computations
On oraclizable networks and Kahn's principle
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On the relations computable by a class of concurrent automata
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Requirements on the execution of Kahn process networks
ESOP'03 Proceedings of the 12th European conference on Programming
| Hi-index | 0.00 |
Using concurrent transition systems [Sta86], we establish connections between three models of concurrent process networks, Kahn functions, input/output automata, and labeled processes. For each model, we define three kinds of algebraic operations on processes: the product operation, abstraction operations, and connection operations. We obtain homomorphic mappings, from input/output automata to labeled processes, and from a subalgebra (called “input/output processes”) of labeled processes to Kahn functions. The proof that the latter mapping preserves connection operations amounts to a new proof of the “Kahn Principle.” Our approach yields: (1) extremely simple definitions of the process operations; (2) a simple and natural proof of the Kahn Principle that does not require the use of “strategies” or “scheduling arguments”; (3) a semantic characterization of a large class of labeled processes for which the Kahn Principle is valid, (4) a convenient operational semantics for nondeterminate process networks.