A Theory of Communicating Sequential Processes

Cited in

(only showing first 100 items - show all)

A note on the notation of recursion in process algebras
FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
Towards general axiomatizations for bisimilarity and trace semantics
Relational structures model of concurrency
Strong fairness and full abstraction for communicating processes
scientific article; zbMATH DE number 988156 (Why is no real title available?)
Unbounded nondeterminism in CSP
A context dependent equivalence between processes
Specification and top-down design of distributed systems
scientific article; zbMATH DE number 1497789 (Why is no real title available?)
Reflections on the future of concurrency theory in general and process calculi in particular
A partial ordering semantics for CCS
Process algebra with four-valued logic
Quantales, observational logic and process semantics
An algebraic theory of interface automata
Process algebra and model checking
Concurrent histories: a basis for observing distributed systems
Combinatorics of labelling in higher-dimensional automata
CSP is a retract of CCS
Trace- and failure-based semantics for responsiveness
scientific article; zbMATH DE number 4039251 (Why is no real title available?)
Failures semantics based on interval semiwords is a congruence for refinement
Essential transitions to bisimulation equivalences
Preserving Contract Satisfiability Under Non-monotonic Composition
The how and why of interactive Markov chains
Specification and verification of database dynamics
On the analysis of cooperation and antagonism in networks of communicating processes
Synchronous message passing: on the relation between bisimulation and refusal equivalence
scientific article; zbMATH DE number 4014017 (Why is no real title available?)
Experience in data network modelling with the help of parallel process language
A fully abstract model for the exchange of information in multi-agent systems.
The metric linear-time branching-time spectrum on nondeterministic probabilistic processes
A truly concurrent semantics for a process algebra using resource pomsets
Decidability results in automata and process theory
Maurer computers for pipelined instruction processing
Journeys in non-classical computation I: A grand challenge for computing research
Specifying termination in CSP
Testing probabilistic automata
Nested-unit Petri nets
On deciding trace equivalences for processes
A denotational semantic theory of concurrent systems
Compositional verification of priority systems using sharp bisimulation
Compositional verification of concurrent systems by combining bisimulations
Structural non-interference in elementary and trace nets
Towards a complete hierarchy of compositional dataflow models
scientific article; zbMATH DE number 795666 (Why is no real title available?)
A ground-complete axiomatisation of finite-state processes in a generic process algebra
Concurrency and atomicity
A complete axiomatisation for observational congruence of finite-state behaviours
An algebraic framework for developing and maintaining real-time systems
Conjunction on processes: Full abstraction via ready-tree semantics
Verification of a class of self-timed computational networks
Proved trees
Notes on the methodology of CCS and CSP
scientific article; zbMATH DE number 3997137 (Why is no real title available?)
Structural operational semantics for weak bisimulations
Hiding in stream semantics of uniform concurrency
Divergence and unique solution of equations
Process algebra with strategic interleaving
A hierarchy of domains for real-time distributed computing
Composing models
Probabilistic may/must testing: retaining probabilities by restricted schedulers
Basic observables for processes
The algebra of communicating processes with empty process
Relating fair testing and accordance for service replaceability
On Finite Bases for Weak Semantics: Failures Versus Impossible Futures
Ready simulation for concurrency: it's logical!
An algebraic theory for web service contracts
A specification structure for deadlock-freedom of synchronous processes
Formally verified animation for RoboChart using interaction trees
Type theory and concurrency
Progress assumption in concurrent systems
Unguardedness mostly means many solutions
Structure preserving bisimilarity, supporting an operational Petri net semantics of CCSP
Asynchronous communication of Petri nets and the refinement of transitions
On cool congruence formats for weak bisimulations
Partial ordering models for concurrency can be defined operationally
Conditions of contracts for separating responsibilities in heterogeneous systems
On the nature of events: another perspective in concurrency
scientific article; zbMATH DE number 7559462 (Why is no real title available?)
Determinacy \(\to\) (observation equivalence \(=\) trace equivalence)
Refinement-preserving plug-in components
Operational and Epistemic Approaches to Protocol Analysis: Bridging the Gap
scientific article; zbMATH DE number 3902015 (Why is no real title available?)
A fully abstract may testing semantics for concurrent objects
Anatomy of a domain of continuous random variables. II
Retracing CSP
A fully abstract semantics for concurrent constraint programming
Quiescence, fairness, testing, and the notion of implementation
A state-based approach to communicating processes
Generating diagnostic information for behavioral preorders
Preferential choice and coordination conditions
\(\pi\)-calculus with noisy channels
Compositional semantics for real-time distributed computing
Stable families of behavioural equivalences
A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences
scientific article; zbMATH DE number 4018375 (Why is no real title available?)
Amalgamation of graph transformations: a synchronization mechanism
Synchronization trees
The timed failures -- Stability model for CSP

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)