Communicating sequential processes
Communications of the ACM
Guarded commands, nondeterminacy and formal derivation of programs
Communications of the ACM
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Process logic: preliminary report
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Scenarios: A Model of Non-Determinate Computation
Proceedings of the International Colloquium on Formalization of Programming Concepts
Modal Logic of Concurrent Nondeterministic Programs
Proceedings of the International Sympoisum on Semantics of Concurrent Computation
Dynamic algebras and the nature of induction
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
VAL- ORIENTED ALGORITHMIC LANGUAGE, PRELIMINARY REFERENCE MANUAL
VAL- ORIENTED ALGORITHMIC LANGUAGE, PRELIMINARY REFERENCE MANUAL
A fixpoint semantics for nondeterministic data flow
Journal of the ACM (JACM)
Completeness and incompleteness of trace-based network proof systems
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Concurrent transition system semantics of process networks
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
OOPSLA '88 Conference proceedings on Object-oriented programming systems, languages and applications
Process semantics: universal axioms compositional rules, and applications
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
A fully abstract trace model for dataflow networks
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Modeling concurrency with geometry
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A model and temporal proof system for networks of processes
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Compiling path expressions into VLSI circuits
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
OOPWORK '86 Proceedings of the 1986 SIGPLAN workshop on Object-oriented programming
Semantic models for concurrency
ACM SIGSOFT Software Engineering Notes
Decidability of split equivalence
Information and Computation
POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A truly concurrent semantics for a process algebra using resource pomsets
Theoretical Computer Science
Valid identity problem for shuffle regular expressions
Journal of Automata, Languages and Combinatorics
Traces, Pomsets, Fairness and Full Abstraction for Communicating Processes
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
A Truly Concurrent Semantics for a Simple Parallel Programming Language
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
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
GEM: A tool for concurrency specification and verification
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
A temporal logic for reasoning about partially ordered computations (Extended Abstract)
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
NIL: An integrated language and system for distributed programming
Proceedings of the 1983 ACM SIGPLAN symposium on Programming language issues in software systems
Liveness properties as convergence in metric spaces
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Transition and cancellation in concurrency and branching time
Mathematical Structures in Computer Science
Higher dimensional automata revisited
Mathematical Structures in Computer Science
The NIL distributed systems programming language: a status report
ACM SIGPLAN Notices
A fully abstract trace model for dataflow and asynchronous networks
Distributed Computing
Automated Analysis of Fault-Tolerance in Distributed Systems
Formal Methods in System Design
Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra
Concurrency, Graphs and Models
Capturing conflict and confusion in CSP
IFM'07 Proceedings of the 6th international conference on Integrated formal methods
ICDCIT'11 Proceedings of the 7th international conference on Distributed computing and internet technology
Adding conflict and confusion to CSP
FM'05 Proceedings of the 2005 international conference on Formal Methods
Models for data-flow sequential processes
CSP'04 Proceedings of the 2004 international conference on Communicating Sequential Processes: the First 25 Years
A survey on temporal logics for specifying and verifying real-time systems
Frontiers of Computer Science: Selected Publications from Chinese Universities
| Hi-index | 0.00 |
We describe a model of net-connected processes that amounts to a reformulation of a model derived by Brock and Ackerman from the Kahn-McQueen model of processes as relations on streams of data. The reformulation leads directly to a straightforward definition of process composition. Our notion of processes and their composition constitutes a natural generalization of the notion of functions and their composition. We apply this definition of process composition to the development of an algebra of processes, which we propose as supplying a formal semantics for a language whose domain of discourse includes nets of interconnected processes. This in turn leads us to logics of such nets, about which we raise three open and fundamental problems: existence of a finite basis for the operations of the language, finite axiomatizability of the equational theory, and decidability of this theory. A natural generalization of the model deals with the time complexity of computations.