Communicating sequential processes

DOI10.1145/359576.359585zbMath0383.68028DBLPjournals/cacm/Hoare78OpenAlexW4211008702WikidataQ56210209 ScholiaQ56210209MaRDI QIDQ4162644

C. A. R. Hoare

Publication date: 1978

Published in: Communications of the ACM (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.186.8184

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Theory of operating systems (68N25)

Related Items (only showing first 100 items - show all)

An axiomatic semantics for nested concurrency ⋮ Partial correctness of exits from concurrent structures ⋮ A theory for nondeterminism, parallelism, communication, and concurrency ⋮ Exploiting parallelism in coalgebraic logic programming ⋮ Verification of \(\mathrm{EB}^3\) specifications using CADP ⋮ A complete rule for equifair termination ⋮ Denotational semantics of communicating sequential programs ⋮ Transformations for communication fairness in CSP ⋮ A distributed algorithm to prevent mutual drift between n logical clocks ⋮ On the existence of symmetric algorithms to find leaders in networks of communicating sequential processes ⋮ Petri nets, algebras, morphisms, and compositionality ⋮ Sémantique asynchrone et comportements infinis en CPS ⋮ A hardware independent parallel programming model ⋮ Two normal form theorems for CSP programs ⋮ Communication in concurrent dynamic logic ⋮ An algebra of processes ⋮ Rewriting with a nondeterministic choice operator ⋮ A distributed algorithm for distributed termination ⋮ The complexity of reachability in distributed communicating processes ⋮ Distributed deadlock detection ⋮ A shared memory algorithm and proof for the generalized alternative construct in CSP ⋮ Cause-effect structures ⋮ An introduction to the regular theory of fairness ⋮ Compiling communicating processes into delay-insensitive VLSI circuits ⋮ Trace, failure and testing equivalences for communicating processes ⋮ Fairness and the axioms of control predicates ⋮ Global renaming operators in concrete process algebra ⋮ Theory of traces ⋮ Transition systems, metric spaces and ready sets in the semantics of uniform concurrency ⋮ Designing equivalent semantic models for process creation ⋮ A timed model for communicating sequential processes ⋮ Semantics of production systems ⋮ Appraising fairness in languages for distributed programming ⋮ A verifiable low-level concurrent programming model based on colored Petri nets ⋮ On the uniqueness of fixed points of endofunctors in a category of complete metric spaces ⋮ Synthesis of communicating process skeletons from temporal-spatial logic specifications ⋮ A software architecture for distributed computer control systems ⋮ Behavioural equivalences of a probabilistic pi-calculus ⋮ Analysis of contract net in multi-agent systems ⋮ Generating the syntactic and semantics graphs for a Markovian process algebra ⋮ Deciding equivalence-based properties using constraint solving ⋮ A cylinder computation model for many-core parallel computing ⋮ Revisiting sequential composition in process calculi ⋮ Relational properties of sequential composition of coalgebras ⋮ A pure labeled transition semantics for the applied pi calculus ⋮ Projection approaches to process mining using region-based techniques ⋮ Theory of interaction ⋮ Verification of distributed systems with the axiomatic system of MSVL ⋮ Using formal methods with SysML in aerospace design and engineering ⋮ Issues in the design of a parallel object-oriented language ⋮ Un modèle asynchrone pour les systèmes distribués. (An asynchronous model of distributed systems) ⋮ Algebraic specification of concurrent systems ⋮ Probabilistic verification of communication protocols ⋮ Proof theory for exception handling in a tasking environment ⋮ The infinite evolution mechanism of \(\epsilon\)-bisimilarity ⋮ A design method for embedded software systems ⋮ On the power of synchronization between two adjacent processes ⋮ Extensional Petri net ⋮ Late and early semantics coincide for testing ⋮ A brief history of Timed CSP ⋮ On the decidability and complexity of the structural congruence for beta-binders ⋮ Logical foundations for programming semantics ⋮ Communicating processes with value-passing and assignments ⋮ Attempting guards in parallel: A data flow approach to execute generalized guarded commands ⋮ CPO semantics of timed interactive actor networks ⋮ Mitigating covert channels based on analysis of the potential for communication ⋮ Building distributed controllers for systems with priorities ⋮ SOS rule formats for zero and unit elements ⋮ Conversation protocols: a formalism for specification and verification of reactive electronic services ⋮ A fluid analysis framework for a Markovian process algebra ⋮ A precongruence format for should testing preorder ⋮ A formal abstract framework for modelling and testing complex software systems ⋮ Step failures semantics and a complete proof system ⋮ Relating state-based and process-based concurrency through linear logic (full-version) ⋮ Efficient model checking for LTL with partial order snapshots ⋮ Coordination of parallel partially ordered processes ⋮ A Rice-style theorem for parallel automata ⋮ Derivation of concurrent programs by stepwise scheduling of Event-B models ⋮ Data flow analysis of distributed communicating processes ⋮ P-A logic - a compositional proof system for distributed programs ⋮ PROCOL. A concurrent object-oriented language with protocols delegation and constraints ⋮ Receptive process theory ⋮ Semantics of algorithmic languages ⋮ Assumption-commitment support for CSP model checking ⋮ A weakest precondition semantics for communicating processes ⋮ Port automata and the algebra of concurrent porcesses ⋮ Parametric channels via label expressions in CCS ⋮ A proof technique for parallel programs ⋮ A linear-history semantics for languages for distributed programming ⋮ Practical LL(1)-based parsing of van Wijngaarden grammars ⋮ An introduction to FIFO nets - monogeneous nets: a subclass of FIFO nets ⋮ Specification-oriented semantics for communicating processes ⋮ Global and local views of state fairness ⋮ A distributed error recovery technique and its implementation and application on UNIX ⋮ Specification and analysis of a data transfer protocol using systems of communicating machines ⋮ A complete axiomatic semantics of spawning ⋮ A formal approach to designing delay-insensitive circuits ⋮ A model of concurrency with fair merge and full recursion ⋮ Fault-tolerant and flexible interconnection of multiple processors ⋮ The probe: An addition to communication primitives

This page was built for publication: Communicating sequential processes