A Theory of Communicating Sequential Processes

Cited in

(only showing first 100 items - show all)

Generating priority rewrite systems for OSOS process languages
Relational concurrent refinement. II: Internal operations and outputs
Calculi for synchrony and asynchrony
A more complete model of communicating processes
A complete inference system for a class of regular behaviours
On the suitability of trace semantics for modular proofs of communicating processes
A proof-theoretic characterization of observational equivalence
Specification-oriented semantics for communicating processes
Determinacy \(\to\) (observation equivalence \(=\) trace equivalence)
A logic for the specification and proof of regular controllable processes of CCS
About fair asynchrony
Denotational semantics of communicating sequential programs
A context dependent equivalence between processes
Concurrent histories: a basis for observing distributed systems
Specification and top-down design of distributed systems
Infinite streams and finite observations in the semantics of uniform concurrency
Specification and verification of database dynamics
Communication in concurrent dynamic logic
On the analysis of cooperation and antagonism in networks of communicating processes
Verification of a class of self-timed computational networks
Trace, failure and testing equivalences for communicating processes
Global renaming operators in concrete process algebra
Transition systems, metric spaces and ready sets in the semantics of uniform concurrency
A timed model for communicating sequential processes
Partial ordering models for concurrency can be defined operationally
A state-based approach to communicating processes
The equational theory of pomsets
Stable families of behavioural equivalences
Compositional semantics for real-time distributed computing
Hiding in stream semantics of uniform concurrency
Type theory and concurrency
Concurrency and atomicity
Correctness of concurrent processes
The equivalence in the DCP model
Partial specifications and compositional verification
Specification styles in distributed systems design and verification
An algebra of concurrent non-deterministic processes
Minimizing the number of transitions with respect to observation equivalence
Semantics for data parallel computation
A model of reconfiguration in communicating sequential processes with a notion of transactions
Enriched categorical semantics for distributed calculi
Unique decomposition of processes
From algebra to operational semantics
Failure-equivalent transformation of transition systems to avoid internal actions
Submodule construction as equation solving in CCS
A complete axiomatisation for observational congruence of finite-state behaviours
The timed failures -- Stability model for CSP
A fully abstract semantics for concurrent constraint programming
Exact performance equivalence: An equivalence relation for stochastic automata
Basic observables for processes
Topology, domain theory and theoretical computer science
On deciding trace equivalences for processes
The connection between an event structure semantics and an operational semantics for TCSP
Infinitary parallelism without unbounded nondeterminism in CSP
A fully abstract trace model for dataflow and asynchronous networks
On sequential composition, action prefixes and process prefix
When is partial trace equivalence adequate?
Property preserving abstractions for the verification of concurrent systems
Synchronization trees
Testing equivalences for processes
On the operational semantics of nondeterminism and divergence
Two implementation relations and the correctness of communicating replicated processes
Deciding true concurrency equivalences on safe, finite nets
Quiescence, fairness, testing, and the notion of implementation
Complexity of equivalence problems for concurrent systems of finite agents
Essential transitions to bisimulation equivalences
The algebra of communicating processes with empty process
Notes on the methodology of CCS and CSP
Process algebra with propositional signals
A fully abstract model for the exchange of information in multi-agent systems.
Reachability problems for sequential dynamical systems with threshold functions.
Linda-based applicative and imperative process algebras
A truly concurrent semantics for a process algebra using resource pomsets
On the validity of encodings of the synchronous in the asynchronous -calculus
\textsc{ULTraS} at work: compositionality metaresults for bisimulation and trace semantics
Conditions of contracts for separating responsibilities in heterogeneous systems
A brief history of process algebra
Schedulers and finishers: on generating and filtering the behaviours of an event structure
Progress assumption in concurrent systems
Amalgamation of graph transformations: a synchronization mechanism
Denotational semantics of communicating processes based on a language for applicative multiprogramming
Bisimilarity of open terms.
Inductive synthesis of recursive processes from logical properties
Strong fairness and full abstraction for communicating processes
Vertical implementation
Axiomatizing GSOS with termination
Asynchronous communication model based on linear logic
Parallel composition of assumption-commitment specifications: A unifying approach for shared variable and distributed message passing concurrency
Compositional failure-based semantic models for basic LOTOS
Discrete time process algebra
Probabilistic may/must testing: retaining probabilities by restricted schedulers
A specification structure for deadlock-freedom of synchronous processes
Deciding bisimilarity and similarity for probabilistic processes.
The metric linear-time branching-time spectrum on nondeterministic probabilistic processes
Process algebra with strategic interleaving
Ensuring liveness properties of distributed systems: open problems
Automated verification of reactive and concurrent programs by calculation
Coupled similarity: the first 32 years
A linear-time branching-time perspective on interface automata
Cartesian difference categories

This page was built for publication: A Theory of Communicating Sequential Processes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3765233)