On the public citation graph

On the relationship of CCS and CSP

https://doi.org/10.1007/bfb0036899
0 signed · 81 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-10003-2_79openalex-snapshot
On observing nondeterminism and concurrency
inferredcites →https://doi.org/10.1007/3-540-10235-3openalex-snapshot
A Calculus of Communicating Systems
inferredcites →https://doi.org/10.1007/3-540-11494-7_5openalex-snapshot
An enlarged definition and complete axiomatization of observational congruence of finite processes
inferredcites →https://doi.org/10.1007/bfb0022510openalex-snapshot
A term model for CCS
inferredcites →https://doi.org/10.1007/bfb0036936openalex-snapshot
Testing equivalences for processes
inferredcites →https://doi.org/10.1109/sfcs.1981.36openalex-snapshot
Possible futures, acceptances, refusals, and communicating processes
inferredcites →https://doi.org/10.1145/357980.358021openalex-snapshot
Communicating sequential processes
inferredcites →https://doi.org/10.1145/359576.359585openalex-snapshot
Communicating sequential processes
inferredcites →https://doi.org/10.1145/828.833openalex-snapshot
A Theory of Communicating Sequential Processes

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11423348_3openalex-snapshot
Process Algebra: A Unifying Approach
inferred← citeshttps://doi.org/10.1007/11539452_21openalex-snapshot
A Ground-Complete Axiomatization of Finite State Processes in Process Algebra
inferred← citeshttps://doi.org/10.1007/11768173_3openalex-snapshot
CSP Is a Retract of CCS
inferred← citeshttps://doi.org/10.1007/3-540-12896-4_356openalex-snapshot
A semantics and proof system for communicating processes
inferred← citeshttps://doi.org/10.1007/3-540-12925-1_44openalex-snapshot
Polynomial-time analysis for a class of communicating processes
inferred← citeshttps://doi.org/10.1007/3-540-15648-8_4openalex-snapshot
An axiomatic treatment of a parallel programming language
inferred← citeshttps://doi.org/10.1007/3-540-15670-4_1openalex-snapshot
On the axiomatic treatment of concurrency
inferred← citeshttps://doi.org/10.1007/3-540-15670-4_12openalex-snapshot
Categories of models for concurrency
inferred← citeshttps://doi.org/10.1007/3-540-15670-4_18openalex-snapshot
Denotational models based on synchronously communicating processes: Refusal, acceptance, safety
inferred← citeshttps://doi.org/10.1007/3-540-15670-4_4openalex-snapshot
Process algebra with asynchronous communication mechanisms
inferred← citeshttps://doi.org/10.1007/3-540-17162-2_128openalex-snapshot
Category theory and models for parallel computation
inferred← citeshttps://doi.org/10.1007/3-540-17162-2_129openalex-snapshot
Categorical models of process cooperation
inferred← citeshttps://doi.org/10.1007/3-540-17906-2_34openalex-snapshot
TCSP: Theory of communicating sequential processes
inferred← citeshttps://doi.org/10.1007/3-540-19488-6_133openalex-snapshot
Computations, residuals, and the power of indeterminacy
inferred← citeshttps://doi.org/10.1007/3-540-54152-7_57openalex-snapshot
Embeddings among concurrent programming languages
inferred← citeshttps://doi.org/10.1007/3-540-55610-9_180openalex-snapshot
A survey of equivalence notions for net based systems
inferred← citeshttps://doi.org/10.1007/3-540-57887-0_124openalex-snapshot
A semantic theory for Concurrent ML
inferred← citeshttps://doi.org/10.1007/978-0-387-35082-0_21openalex-snapshot
Towards a calculus for generative communication
inferred← citeshttps://doi.org/10.1007/978-0-387-35412-5_12openalex-snapshot
Specifying Interactions in Integrated Manufacturing Systems
inferred← citeshttps://doi.org/10.1007/978-1-4471-3534-0_14openalex-snapshot
Specifying Processes in Terms of Their Environments
inferred← citeshttps://doi.org/10.1007/978-3-030-02450-5_18openalex-snapshot
Preserving Liveness Guarantees from Synchronous Communication to Asynchronous Unstructured Low-Level Languages
inferred← citeshttps://doi.org/10.1007/978-3-030-92124-8_14openalex-snapshot
Translation of CCS into CSP, Correct up to Strong Bisimulation
inferred← citeshttps://doi.org/10.1007/978-3-031-91118-7_4openalex-snapshot
Constructive characterisations of the MUST-preorder for asynchrony
inferred← citeshttps://doi.org/10.1007/978-3-319-48989-6_22openalex-snapshot
An Algebra of Synchronous Atomic Steps
inferred← citeshttps://doi.org/10.1007/978-3-540-92188-2_9openalex-snapshot
Multiple Viewpoint Contract-Based Specification and Design
inferred← citeshttps://doi.org/10.1007/978-3-642-72822-8_36openalex-snapshot
Interface as a Basic Concept for Systems Specification and Verification
inferred← citeshttps://doi.org/10.1007/978-3-642-82453-1_9openalex-snapshot
Notes on Algebraic Calculi of Processes
inferred← citeshttps://doi.org/10.1007/bf00268075openalex-snapshot
Specification-oriented semantics for Communicating Processes
inferred← citeshttps://doi.org/10.1007/bf01094341openalex-snapshot
Tools for specifying real-time systems
inferred← citeshttps://doi.org/10.1007/bf01407903openalex-snapshot
Trace, failure and testing equivalences for communicating processes
inferred← citeshttps://doi.org/10.1007/bf01762125openalex-snapshot
On the analysis of cooperation and antagonism in networks of communicating processes
inferred← citeshttps://doi.org/10.1007/bfb0013021openalex-snapshot
Process theory based on bisimulation semantics
inferred← citeshttps://doi.org/10.1007/bfb0015727openalex-snapshot
Linear and branching structures in the semantics and logics of reactive systems
inferred← citeshttps://doi.org/10.1007/bfb0016222openalex-snapshot
Some equivalence notions for concurrent systems. An overview
inferred← citeshttps://doi.org/10.1007/bfb0027040openalex-snapshot
Contrasting themes in the semantics of imperative concurrency
inferred← citeshttps://doi.org/10.1007/bfb0030326openalex-snapshot
Models and operators for nondeterministic processes
inferred← citeshttps://doi.org/10.1007/bfb0036900openalex-snapshot
Behavioural equivalence relations induced by programming logics
inferred← citeshttps://doi.org/10.1007/bfb0036949openalex-snapshot
Synchronisation trees
inferred← citeshttps://doi.org/10.1007/bfb0084811openalex-snapshot
Embeddings among concurrent programming languages
inferred← citeshttps://doi.org/10.1007/s00165-009-0133-8openalex-snapshot
Translating FSP into LOTOS and networks of automata
inferred← citeshttps://doi.org/10.1007/s00236-019-00356-4openalex-snapshot
Coupled similarity: the first 32 years
inferred← citeshttps://doi.org/10.1007/s12652-013-0209-4openalex-snapshot
Design-time formal verification for smart environments: an exploratory perspective
inferred← citeshttps://doi.org/10.1016/0304-3975(84)90022-7openalex-snapshot
A linear-history semantics for languages for distributed programming
inferred← citeshttps://doi.org/10.1016/0304-3975(85)90028-3openalex-snapshot
Determinancy → (observation equivalence = trace equivalence)
inferred← citeshttps://doi.org/10.1016/0304-3975(87)90002-8openalex-snapshot
Infinite streams and finite observations in the semantics of uniform concurrency
inferred← citeshttps://doi.org/10.1016/0304-3975(89)90050-9openalex-snapshot
Concurrent transition systems
inferred← citeshttps://doi.org/10.1016/0890-5401(90)90025-dopenalex-snapshot
CCS expressions, finite state processes, and three problems of equivalence
inferred← citeshttps://doi.org/10.1016/0890-5401(90)90058-popenalex-snapshot
A compositional proof system on a category of labelled transition systems
inferred← citeshttps://doi.org/10.1016/b978-0-408-02938-4.50016-4openalex-snapshot
Key references in distributed computer systems 1959–1989
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.12.012openalex-snapshot
CSP is a retract of CCS
inferred← citeshttps://doi.org/10.1016/s0019-9958(84)80025-xopenalex-snapshot
Process algebra for synchronous communication
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00251-4openalex-snapshot
Notes on the methodology of CCS and CSP
inferred← citeshttps://doi.org/10.1017/cbo9780511526619.008openalex-snapshot
Categories in Concurrency
inferred← citeshttps://doi.org/10.1017/cbo9780511550850.005openalex-snapshot
Linearity and Nonlinearity in Distributed Computation
inferred← citeshttps://doi.org/10.1017/cbo9781139195003openalex-snapshot
Process Algebra: Equational Theories of Communicating Processes
inferred← citeshttps://doi.org/10.1017/s0960129508007111openalex-snapshot
A ground-complete axiomatisation of finite-state processes in a generic process algebra
inferred← citeshttps://doi.org/10.1093/comjnl/30.6.498openalex-snapshot
Ready-Trace Semantics for Concrete Process Algebra with the Priority Operator
inferred← citeshttps://doi.org/10.1109/32.58782openalex-snapshot
The specification and verified decomposition of system requirements using CSP
inferred← citeshttps://doi.org/10.1109/icoin.1998.648443openalex-snapshot
A study on implementation of model checking tool for verifying LTS specifications
inferred← citeshttps://doi.org/10.1137/0217073openalex-snapshot
Readies and Failures in the Algebra of Communicating Processes
inferred← citeshttps://doi.org/10.1145/120807.120812openalex-snapshot
Compositional reachability analysis using process algebra
inferred← citeshttps://doi.org/10.1145/323596.323599openalex-snapshot
On the analysis of cooperation and antagonism in networks of communicating processes
inferred← citeshttps://doi.org/10.1145/73560.73580openalex-snapshot
Bisimulation can't be traced
inferred← citeshttps://doi.org/10.1145/800221.806724openalex-snapshot
CCS expressions, finite state processes, and three problems of equivalence
inferred← citeshttps://doi.org/10.1145/828.833openalex-snapshot
A Theory of Communicating Sequential Processes
inferred← citeshttps://doi.org/10.1177/1063293x9700500106openalex-snapshot
Information Control Nets as Processes: Qualitative Analysis
inferred← citeshttps://doi.org/10.4204/eptcs.190.5openalex-snapshot
Encoding CSP into CCS
inferred← citeshttps://doi.org/10.4204/eptcs.368.4openalex-snapshot
From CCS to CSP: the m-among-n Synchronisation Approach
inferred← citeshttps://doi.org/10.48550/arxiv.0706.1456openalex-snapshot
A Generic Model of Contracts for Embedded Systems
inferred← citeshttps://doi.org/10.48550/arxiv.1508.01127openalex-snapshot
Encoding CSP into CCS (Extended Version)
inferred← citeshttps://doi.org/10.6028/nist.ir.6484openalex-snapshot
Specification of interactions in integrated manufacturing systems
inferred← citeshttps://doi.org/10.7146/dpb.v22i463.6936openalex-snapshot
Models for Concurrency
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.