A fixpoint semantics for nondeterministic data flow
Journal of the ACM (JACM)
A model and temporal proof system for networks of processes
Distributed Computing
Denotational semantics of nets with nondeterminism
Proc. of the European symposium on programming on ESOP 86
A theory for nondeterminism, parallelism, communication, and concurrency
Theoretical Computer Science
A fully abstract semantics for data flow nets
Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
Hierarchical correctness proofs for distributed algorithms
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Modular verification of asynchronous networks
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Nondeterministic data flow programs: how to avoid the merge anomaly
Science of Computer Programming
A model and proof system for asynchronous networks
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Specifying Concurrent Program Modules
ACM Transactions on Programming Languages and Systems (TOPLAS)
A straightforward denotational semantics for non-determinate data flow programs
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
On the composition of processes
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
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
The Pomset Model of Parallel Processes: Unifying the Temporal and the Spatial
Seminar on Concurrency, Carnegie-Mellon University
Proving safety and liveness of communicating processes with examples
PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
FOUNDATIONS OF A THEORY OF SPECIFICATION FOR DISTRIBUTED SYSTEMS
FOUNDATIONS OF A THEORY OF SPECIFICATION FOR DISTRIBUTED SYSTEMS
On oraclizable networks and Kahn's principle
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Separating concurrent languages with categories of language embeddings
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Functional specification of time-sensitive communicating systems
ACM Transactions on Software Engineering and Methodology (TOSEM)
BPM Based Robust E-business Application Development (Practical Experience Report)
EDCC-4 Proceedings of the 4th European Dependable Computing Conference on Dependable Computing
ObjChart: Tangible Specification of Reactive Object Behavior
ECOOP '93 Proceedings of the 7th European Conference on Object-Oriented Programming
A relational model of non-deterministic dataflow
Mathematical Structures in Computer Science
Non-interleaving Semantics with Causality for Nondeterministic Dataflow
Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
Branching vs. linear time: semantical perspective
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
Fairness, Resources, and Separation
Electronic Notes in Theoretical Computer Science (ENTCS)
Compositional construction of real-time dataflow networks
COORDINATION'10 Proceedings of the 12th international conference on Coordination Models and Languages
Regular paper: Temporal analysis of data flow control systems
Automatica (Journal of IFAC)
| Hi-index | 0.00 |
A dataflow network consists of nodes that communicate over perfect FIFO channels. For dataflow networks containing only deterministic nodes, a simple and elegant semantic model has been presented by Kahn. However, for nondeterministic networks, the straight-forward generalization of Kahn's model is not compositional. We present a compositional model for nondeterministic networks, which is fully abstract, i.e., it has added the least amount of extra information to Kahn's model which is necessary for attaining compositionality. The model is based on traces.