Models for data-flow sequential processes

Authors:
Mark B. Josephs
Affiliations:
Centre for Concurrent Systems and Very-Large-Scale Integration, Faculty of BCIM, London South Bank University, London, UK
Venue:
CSP'04 Proceedings of the 2004 international conference on Communicating Sequential Processes: the First 25 Years
Year:
2004

Citing 16
Cited 2

Communicating sequential processes

Communicating sequential processes
Specification-oriented semantics for communicating processes

Acta Informatica
Modeling concurrency with partial orders

International Journal of Parallel Programming
A theory for nondeterminism, parallelism, communication, and concurrency

Theoretical Computer Science
The equational theory of pomsets

Theoretical Computer Science
On denotational versus predictive semantics

Journal of Computer and System Sciences
Receptive process theory

Acta Informatica
The expressive power of indeterminate dataflow primitives

Information and Computation
A model and proof system for asynchronous networks

Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Predicative programming Part II

Communications of the ACM
The Theory and Practice of Concurrency

The Theory and Practice of Concurrency
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
Traces, Pomsets, Fairness and Full Abstraction for Communicating Processes

CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Denotational Semantics for occam

Seminar on Concurrency, Carnegie-Mellon University
An Improved Failures Model for Communicating Processes

Seminar on Concurrency, Carnegie-Mellon University

A process-algebraic approach to workflow specification and refinement

SC'07 Proceedings of the 6th international conference on Software composition
Termination without ✓ in CSP

FM'11 Proceedings of the 17th international conference on Formal methods

Quantified Score

Hi-index	0.00

Visualization

Abstract

A family of mathematical models of nondeterministic data flow is introduced. These models are constructed out of sets of traces, successes, failures and divergences, cf. Hoare's traces model, Roscoe's stable-failures model and Brookes and Roscoe's failures/divergences model of Communicating Sequential Processes. As in CSP, operators are defined that are convenient for constructing processes in the various models.