Abstract
The process calculus CCS for describing reactive systems is introduced. Its syntax is defined, as well as its operational semantics in terms of labeled transition systems. Some subcalculi are singled out that possess some specific interesting expressiveness properties. It is shown that CCS is Turing-complete by offering an encoding of Counter Machines into CCS. As a byproduct, all the behavioral equivalences of interest are undecidable over the class of CCS processes, even if they are decidable over some subcalculi.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Gorrieri, R., Versari, C. (2015). CCS: A Calculus of Communicating Systems. In: Introduction to Concurrency Theory. Texts in Theoretical Computer Science. An EATCS Series. Springer, Cham. https://doi.org/10.1007/978-3-319-21491-7_3
Download citation
DOI: https://doi.org/10.1007/978-3-319-21491-7_3
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-21490-0
Online ISBN: 978-3-319-21491-7
eBook Packages: Computer ScienceComputer Science (R0)