Communicating sequential processes

Cited in

(only showing first 100 items - show all)

A Rice-style theorem for parallel automata
Assumption-commitment support for CSP model checking
An introduction to FIFO nets - monogeneous nets: a subclass of FIFO nets
Specification-oriented semantics for communicating processes
The probe: An addition to communication primitives
An axiomatic semantics for nested concurrency
Partial correctness of exits from concurrent structures
A theory for nondeterminism, parallelism, communication, and concurrency
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
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
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
Compositional semantics for real-time distributed computing
Concurrent transition systems
The contraction property is sufficient to guarantee the uniqueness of fixed points of endofunctors in a category of complete metric spaces
Semantics of nondeterminism, concurrency, and communication
On the use of history variables
The complexity of problems in systems of communicating sequential processes
Deadlock absence proofs for networks of communicating processes
A proof technique for communicating sequential processes
Methods and means of parallel processing of information
Optimal networks for distributing nonsequential programs
Towards a foundation for semantics in complete metric spaces
The equivalence in the DCP model
A proof system for communicating processes with value-passing
Tuning distributed control algorithms for optimal functioning
Distributed event algebras
A compositional protocol verification using relativized bisimulation
The impact of the number of cooperating grammars on the generative power
A layered semantics for a parallel object-oriented language
Experimenting with process equivalence
Defining conditional independence using collapses
A class of systems with nearly zero distributed simulation overhead
Efficient distributed simulation of acyclic systems
Verification of distributed programs using representative interleaving sequences
Enriched categorical semantics for distributed calculi
Failure-equivalent transformation of transition systems to avoid internal actions
A case for a forward predicate transformer
Some impossibility results in interprocess synchronization
Fairness and hyperfairness in multi-party interactions
Representation of computations in concurrent automata by dependence orders
The comparison of a cpo-based semantics with a cms-based semantics for \(CSP\)
Asynchronous and corrected-asynchronous finite difference solutions of PDEs on MIMD multiprocessors
Proving partial order properties
A theory of timed automata
Axiomatic-like performance analysis (ALPA)
Some hierarchies for the communication complexity measures of cooperating grammar systems
A trace-based compositional proof theory for fault tolerant distributed systems
Program composition via unification
On sequential composition, action prefixes and process prefix
Reasoning about dynamically evolving process structures
When is partial trace equivalence adequate?
Labelled domains and automata with concurrency
Testing equivalences for processes
On the operational semantics of nondeterminism and divergence
Dynamic graph models
A process algebra of communicating shared resources with dense time and priorities
Processes are in the eye of the beholder
Equivalence is in the eye of the beholder
Fairness in shared invocation servicing
A semantic theory for value-passing processes based on the late approach
A fully abstract model for the exchange of information in multi-agent systems.
Two decentralized algorithms for strong interaction fairness for systems with unbounded speed variability
Nivat's processes and their synchronization
Additive models of probabilistic processes
Equational rules for rewriting logic
Accelerating Petri-net simulations using NVIDIA graphics processing units
Compositional and local livelock analysis for CSP
Decompositions of graphs based on a new graph product
Compiling and verifying SC-SystemJ programs for safety-critical reactive systems
Rule formats for distributivity
A framework for specifying and verifying the behaviour of open systems
A brief history of process algebra
Bestow and atomic: concurrent programming using isolation, delegation and grouping
Schedulers and finishers: on generating and filtering the behaviours of an event structure

This page was built for publication: Communicating sequential processes

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