Notes on the methodology of CCS and CSP

DOI10.1016/S0304-3975(96)00251-4zbMath0901.68067MaRDI QIDQ1391789

Robert J. van Glabbeek

Publication date: 23 July 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

process algebraconcurrency

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (6)

CSP-CASL -- a new integration of process algebra and algebraic specification ⋮ A ground-complete axiomatisation of finite-state processes in a generic process algebra ⋮ CSP is a retract of CCS ⋮ Ready to preorder: the case of weak process semantics ⋮ On Finite Bases for Weak Semantics: Failures Versus Impossible Futures ⋮ A Generic Process Algebra

Cites Work

• Specification-oriented semantics for communicating processes
• Ready-Trace Semantics for Concrete Process Algebra with the Priority Operator
• A Theory of Communicating Sequential Processes
• On the termination of program schemas
• Processes and the denotational semantics of concurrency
• Two Complete Axiom Systems for the Algebra of Regular Events
• On the Forms of the Predicates in the Theory of Constructive Ordinals
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Notes on the methodology of CCS and CSP